Systems and methods for generating basis paths for autonomous vehicle motion control

ABSTRACT

Systems and methods for basis path generation are provided. In particular, a computing system can obtain a target nominal path. The computing system can determine a current pose for an autonomous vehicle. The computing system can determine, based at least in part on the current pose of the autonomous vehicle and the target nominal path, a lane change region. The computing system can determine one or more merge points on the target nominal path. The computing system can, for each respective merge point in the one or more merge points, generate a candidate basis path from the current pose of the autonomous vehicle to the respective merge point. The computing system can generate a suitability classification for each candidate basis path. The computing system can select one or more candidate basis paths based on the suitability classification for each respective candidate basis path in the plurality of candidate basis paths.

RELATED APPLICATION

This application claims priority to and the benefit of U.S. ProvisionalPatent Application No. 63/077,285, filed Sep. 11, 2020, which is herebyincorporated by reference in its entirety.

FIELD

The present disclosure relates generally to autonomous vehicles. Moreparticularly, the present disclosure relates to path planning forautonomous vehicles.

BACKGROUND

An autonomous vehicle is a vehicle that is capable of sensing itsenvironment and navigating without human input. In particular, anautonomous vehicle can observe its surrounding environment using avariety of sensors and can attempt to comprehend the environment byperforming various processing techniques on data collected by thesensors. Given knowledge of its surrounding environment, the autonomousvehicle can identify an appropriate motion path for navigating throughsuch a surrounding environment.

SUMMARY

Aspects and advantages of embodiments of the present disclosure will beset forth in part in the following description, or can be learned fromthe description, or can be learned through practice of the embodiments.

One example aspect of the present disclosure is directed to acomputer-implemented method. The method can include obtaining, by acomputing system comprising one or more processors, a target nominalpath. The method can include determining, by the computing system, acurrent pose for the autonomous vehicle. The method can includedetermining, by the computing system and based at least in part on thecurrent pose of the autonomous vehicle and the target nominal path, alane change region. The method can include determining, by the computingsystem, one or more merge points on the target nominal path. The methodcan include, for each respective merge point in the one or more mergepoints, generating, by the computing system, a candidate basis path fromthe current pose of the autonomous vehicle to the respective mergepoint, such that a plurality of candidate basis paths are generated. Themethod can include generating, by the computing system, a suitabilityclassification for each candidate basis path. The method can includeselecting, by the computing system, one or more candidate basis pathsbased on the suitability classification for each respective candidatebasis path in the plurality of candidate basis paths.

Another example aspect of the present disclosure is directed to acomputing system. The computing system can include one or moreprocessors and one or more non-transitory computer-readable memories,wherein the one or more non-transitory computer-readable memories storeinstructions that, when executed by the processor, cause the computingsystem to perform operations. The computing system can obtain a targetnominal path. The computing system can determine a current pose for theautonomous vehicle. The computing system can determine based on thecurrent pose of the autonomous vehicle and the target nominal path, alane change region. The computing system can determine one or more mergepoints on the target nominal path. The computing system can, for eachrespective merge point in the one or more merge points, generate acandidate basis path from the current pose of the autonomous vehicle tothe respective merge point such that a plurality of candidate basispaths are generated. The computing system can generate a suitabilityclassification for each candidate basis path. The computing system canselect a candidate basis path based on the suitability classificationfor each respective candidate basis path in the plurality of candidatebasis paths.

Yet another example aspect of the present disclosure is directed to anautonomous vehicle. The autonomous vehicle can obtain a target nominalpath. The autonomous vehicle can determine a current pose for theautonomous vehicle. The autonomous vehicle can determine based on thecurrent pose of the autonomous vehicle and the target nominal path, alane change region. The autonomous vehicle can determine one or moremerge points on the target nominal path. The autonomous vehicle can, foreach respective merge point in the one or more merge points, generate acandidate basis path from the current pose of the autonomous vehicle tothe respective merge point such that a plurality of candidate basispaths are generated. The autonomous vehicle can generate a suitabilityclassification for each candidate basis path. The autonomous vehicle canselect a candidate basis path based on the suitability classificationfor each respective candidate basis path in the plurality of candidatebasis paths.

Other aspects of the present disclosure are directed to various systems,apparatuses, non-transitory computer-readable media, user interfaces,and electronic devices.

The autonomous vehicle technology described herein can help improve thesafety of passengers of an autonomous vehicle, improve the safety of thesurroundings of the autonomous vehicle, improve the experience of therider and/or operator of the autonomous vehicle, as well as provideother improvements as described herein. Moreover, the autonomous vehicletechnology of the present disclosure can help improve the ability of anautonomous vehicle to effectively provide vehicle services to others andsupport the various members of the community in which the autonomousvehicle is operating, including persons with reduced mobility and/orpersons that are underserved by other transportation options.Additionally, the autonomous vehicle of the present disclosure mayreduce traffic congestion in communities as well as provide alternateforms of transportation that may provide environmental benefits.

These and other features, aspects, and advantages of various embodimentsof the present disclosure will become better understood with referenceto the following description and appended claims. The accompanyingdrawings, which are incorporated in and constitute a part of thisspecification, illustrate example embodiments of the present disclosureand, together with the description, serve to explain the relatedprinciples.

BRIEF DESCRIPTION OF THE DRAWINGS

Detailed discussion of embodiments directed to one of ordinary skill inthe art is set forth in the specification, which refers to the appendedfigures, in which:

FIG. 1 depicts a block diagram of an example autonomous vehicleaccording to example embodiments of the present disclosure.

FIG. 2A depicts a diagram of an example system including a plurality ofdevices configured to execute one or more processes according to exampleimplementations of the present disclosure.

FIG. 2B depicts a diagram of an example functional graph according toexample implementations of the present disclosure.

FIG. 3A depicts a block diagram of an example motion planning systemaccording to example embodiments of the present disclosure.

FIG. 3B depicts a block diagram of an example basis path generationsystem according to example embodiments of the present disclosure.

FIG. 4 depicts an example diagram illustrating an autonomous vehiclemerging with a target path according to example embodiments of thepresent disclosure.

FIG. 5 depicts an example diagram illustrating the generation of a basispath for changing lanes according to example embodiments of the presentdisclosure.

FIG. 6 depicts an example diagram illustrating the generation of mergepoints within a lane change region (608 and 618) according to exampleembodiments of the present disclosure.

FIG. 7 depicts an example diagram illustrating the alteration of laneboundaries according to example embodiments of the present disclosure.

FIG. 8 depicts a flow chart diagram of an example method according toexample embodiments of the present disclosure.

FIG. 9 depicts an example system with units for performing operationsand functions according to example aspects of the present disclosure.

FIG. 10 depicts example system components according to example aspectsof the present disclosure.

DETAILED DESCRIPTION

Generally, the present disclosure is directed to generating a basis pathfor use by an autonomous vehicle as it generates motion plans fornavigating through its environment. A basis path can be generated duringan initial part of the path planning process. A basis path can be aninitial path that can be used to generate and evaluate candidatetrajectories. To generate a basis path, a vehicle computing systemassociated with the autonomous vehicle can access a nominal path (e.g.,a predetermined path through an area such as the centerline of a lane)for a location associated with the autonomous vehicle. The vehiclecomputing system can identify a current position and pose of theautonomous vehicle. Based on the current position and pose of theautonomous vehicle, the vehicle computing system can generate a basispath from the current position to a point along the nominal path. Thebasis path can then represent a particular route from the autonomousvehicle's current position to a position along a predetermined nominalpath.

In some examples, the vehicle computing system can generate a basis pathto change from a first lane to a second lane. To do so, the vehiclecomputing system can access a target nominal path associated with thetarget lane. In some examples, the vehicle computing system can identifya plurality of potential target nominal paths. For example, if anautonomous vehicle determines that it needs to change lanes to avoid anobstacle, the autonomous vehicle can evaluate multiple potential targetlanes, each with an associated nominal path. The vehicle computingsystem can access information describing the current heading, speed, andposition of the autonomous vehicle. The vehicle computing system canidentify at least one lane change region along the current lane boundaryassociated with the autonomous vehicle (e.g., the lane boundaryassociated with the lane in which the autonomous vehicle is currentlylocated).

The vehicle computing system can identify one or more potential mergepoints along the target nominal path (or multiple target nominal paths)based at least in part on the lane change region. A merge point canrepresent a particular location along a target nominal path at which theautonomous vehicle can join the target nominal path. The vehiclecomputing system can generate a plurality of candidate basis paths, eachcandidate basis path representing a potential path from the currentposition of the autonomous vehicle to one of the identified mergepoints. Each candidate path can be evaluated to determine whether itmeets one or more drivability constraints. Drivability constraints caninclude the maximum allowable acceleration and turning rate, among otherpossible criteria. The vehicle computing system can select a candidatebasis path from the plurality of candidate basis paths.

In an example of the disclosed systems and methods, an autonomousvehicle can use a vehicle computing system to transition from a firstlane to a second lane. As part of this process, the vehicle computingsystem can determine that the autonomous vehicle will move from theautonomous vehicle's current lane to another lane. This determinationcan be made based on an instruction from a remote services system and/orbased on the analysis of a path planning module/system, associated withthe vehicle computing system. The vehicle computing system can access anominal path associated with the target lane from a map database. Thevehicle computing system can identify a lane change region based on thecurrent position, velocity, and pose of the autonomous vehicle. The lanechange region can be an area in which the vehicle computing system plansto change from the current lane to the target lane. The lane changeregion's distance from the vehicle and total size can be determinedbased on a plurality of factors including, but not limited to, thecurrent speed of the autonomous vehicle, the density of other objects inthe travel way (e.g., a dense road will result in a larger lane changeregion to allow more flexibility to navigate around otheractors/objects), factors associated with the environment itself (e.g.,if the current lane is ending, the lane change region is placed beforethe end of the current lane), etc.

The vehicle computing system can alter its internally storedrepresentation of the lane boundaries between the current lane and thetarget lane to remove the lane boundaries within the lane change region.In this way, the vehicle computing system can plan a path that crossesthe actual lane boundaries while in the lane change region. The vehiclecomputing system can determine a plurality of merge points along thetarget nominal path. The vehicle computing system can plan a pluralityof candidate basis paths, each candidate basis path representing a routefrom the current position of the autonomous vehicle to one of thedetermined merge points.

The vehicle computing system can evaluate each candidate basis path bygenerating a cost value for each candidate basis path. One factor thatthe vehicle computing system can consider when generating a costassociated with each candidate basis path is the drivability of thecandidate basis path. Thus, the vehicle computing system can analyzeeach candidate basis path to determine whether maximum acceleration,velocity, jerk, and/or turning rate values for the candidate basispaths. These values can be compared to predetermined threshold valuesfor each of these values and the vehicle computing system can increasethe costs of candidate basis paths that exceed the threshold values. Thevehicle computing system can select a particular candidate basis pathbased on the costs associated with the plurality of candidate basispaths. The vehicle computing system can then use this selected basispath to generate a motion plan for the autonomous vehicle.

In some examples, the vehicle computing system can include a geometricplanner. The geometric planner can access map geometry for the areaaround the autonomous vehicle, including, but not limited to a nominalpath and lane boundaries. The geometric planner may modify the nominalpath to transition between the current location and pose of theautonomous vehicle and the target path or destination of the autonomousvehicle.

More specifically, the above-described vehicle computing system can beincluded in an autonomous vehicle (e.g., ground-based vehicle, aerialvehicle, etc.). For example, an autonomous vehicle can include a vehiclecomputing system. The vehicle computing system can be responsible for,among other functions, creating the control signals needed toeffectively control an autonomous vehicle. The vehicle computing systemcan include an autonomy computing system. The autonomy computing systemcan include one or more systems that enable the autonomous vehicle toplan and/or follow a given route, receive sensor data about theenvironment, perceive objects within the vehicle's surroundingenvironment (e.g., other vehicles), predict the motion of the objectswithin the surrounding environment, and generate trajectories for thevehicle to follow based on the route/perceived objects/predicted objectmotion. The autonomy system can output data indicative of the generatedtrajectories and corresponding control signals can be sent to vehiclecontrol system(s) (e.g., acceleration, steering, braking, etc. systems)to enable the autonomous vehicle to autonomously navigate (e.g., to itstarget destination).

To accomplish these operations, the autonomy computing system caninclude, for example, a perception system, a prediction system, and amotion planning system. Many of the functions performed by theperception system, prediction system, and motion planning system can beperformed, in whole or in part, by one or more machine-learning models.Moreover, one or more of the perception system, prediction system,and/or motion planning system (or the functions associated therewith)can be combined into a single system and/or share computing resources.

To help maintain awareness of the vehicle's surrounding environment, thevehicle computing system can access sensor data from one or more sensors(e.g., LIDAR, RADAR, camera, etc.) to identify static objects and/ordynamic objects (actors) in the autonomous vehicle's environment. Tohelp determine its position within the environment (and relative tothese objects), the vehicle computing system can provide sensor data tothe structured machine-learned model(s). In addition or alternatively,the autonomous vehicle can access map data (e.g., high definition mapdata, etc.) to determine the autonomous vehicle's current positionrelative to other objects in the world (e.g., bicycles, pedestrians,other vehicles, buildings, etc.), as well as map features such as, forexample, lane boundaries, curbs, and so on.

The computing system of an autonomous vehicle can include a plurality ofdevices (e.g., physically-connected devices, wirelessly-connecteddevices, virtual devices running on a physical machine, etc.) thatimplement a software graph architecture of the autonomous vehicle. Forinstance, the computing devices can implement the vehicle's autonomysoftware that helps allow the vehicle to autonomously operate within itsenvironment. Each device can include a compute node configured to runone or more processes. A process can include a plurality of functionnodes (e.g., software functions) connected by one or more directed edgesthat dictate the flow of data between the plurality of function nodes. Adevice can execute (e.g., via one or more processors, etc.) a respectiveplurality of function nodes to run a respective process. The pluralityof processes can be collectively configured to perform one or more tasksor services of the computing system. To do so, the plurality ofprocesses can be configured to communicate (e.g., send/receive messages)with each other over one or more communication channels (e.g., wiredand/or wireless networks). By way of example, with respect to thevehicle's onboard computing system, its processes (and their respectivefunction nodes) can be organized into a directed software grapharchitecture (e.g., including sub-graphs) that can be executed tocommunicate and perform the operations of the autonomous vehicle (e.g.,for autonomously sensing the vehicle's environment, planning thevehicle's motion, etc.).

The vehicle computing system can utilize the sensor data to identify oneor more objects in the local environment of the autonomous vehicle.Using this sensor data, the vehicle computing system can generateperception data that describes one or more object(s) in the vicinity ofthe autonomous vehicle (e.g., current location, speed, heading,shape/size, etc.).

The generated perception data can be utilized to predict the futuremotion of the object(s). For example, the vehicle computing system canuse the perception data to generate predictions for the movement of oneor more objects as an object trajectory including one or more futurecoordinates/points. In some implementations, the perception andprediction functions of the vehicle computing system can be includedwithin the same system.

The vehicle computing system can use the perception data, predictiondata, map data, and/or other data to generate a motion plan for thevehicle. As noted above, one part of generating a motion plan caninclude generating a basis path to take the autonomous vehicle from thecurrent position to a point along a target nominal path. The nominalpath can represent an ideal path through an environment or travel waywithout consideration of any other actors in the environment (e.g., apath that travels down the center of a lane).

A basis path can describe a specific path for the autonomous vehicle totravel from a current location to a destination location. The basis pathcan be generated at a system that is remote from the autonomous vehicleand communicated to the autonomous vehicle and/or the basis path can begenerated onboard the autonomous vehicle. The vehicle computing systemcan generate potential trajectories for the autonomous vehicle to followas it traverses the basis path. Each potential trajectory can representa variation of the basis path, such that it can be shifted laterallyalong the basis path and is assigned a specific speed profile. Aplurality of potential trajectories can be generated such that a largenumber of lateral variations of the basis path are considered. Eachpotential trajectory can be executable by the autonomous vehicle (e.g.,feasible for the vehicle control systems to implement). Each trajectorycan be generated to comprise a specific amount of travel time (e.g.,eight seconds, etc.).

The autonomous vehicle can select and implement a trajectory for theautonomous vehicle to navigate a specific segment of the route. Forinstance, the trajectory can be translated and provided to the vehiclecontrol system(s) (e.g., via a vehicle interface/controller) that cangenerate specific control signals for the autonomous vehicle (e.g.,alter steering, braking, velocity, and so on). The specific controlsignals can cause the autonomous vehicle to move in accordance with theselected trajectory.

The vehicle computing system of the autonomous vehicle can generatetrajectories for the autonomous vehicle using a multi-step process. Insome examples, some steps of the process can be performed out-of-cycle(e.g., not part of the real-time path generation cycle) and some stepsof the process are performed during the real-time path generation cycle.

The out-of-cycle steps can include generating lane geometry for aplurality of potential lanes including, but not limited to laneboundaries for one or more lanes, determining a nominal path orcenterline for each lane, and/or determining any other relevant factorsfor a particular area. In some examples, generating lane geometry may beaccomplished or assisted by a geometry planner. In addition togenerating lane geometry, the vehicle computing system can, as anotherout of cycle step, generate a list of static objects in the relevantgeographic area, including, but not limited to, buildings, signs,mailboxes, other semi-permanent fixtures, etc. The lane geometry(including one or more nominal paths) can be accessed by the vehiclecomputing system while performing in-cycle path planning.

The vehicle computing system can, using the information provided by theout-of-cycle components of the vehicle computing system (e.g., lanegeometry and static obstacle information) to generate a basis path forthe autonomous vehicle.

The basis path can be generated by a basis path generation system. Thebasis path generation system can include a vehicle state analysissystem, a merge point selection system, a geometry modification system,and a candidate analysis system.

The vehicle state analysis system can determine the current state of theautonomous vehicle. For example, the vehicle state analysis system candetermine the current position (e.g., using an x, y coordinate), speed,heading, acceleration, and turning radius of the autonomous vehicle.

Once the state of the autonomous vehicle is determined, the merge pointselection system can generate a plurality of candidate merge points atwhich the autonomous vehicle can join (or rejoin) the target nominalpath. In some examples, the merge point selection system can determine alane change region associated with joining the target nominal path(e.g., in situations in which the autonomous vehicle is changing lanes).In some examples, lane change regions are predetermined features of thelane geometry that represent an area in which lane changes are possible.In other examples, a lane change region can be determined dynamicallybased on the position and speed of the autonomous vehicle as well as thegeometry of the lanes. Thus, if the autonomous vehicle is travelingfaster, the merge point selection system can select a larger lane changeregion to give additional flexibility to the autonomous vehicle.

In some examples, the merge points can be existing features of the lanegeometry. In this case, the merge point selection system can identifyall merge points that are within a selected lane change region (orproximate thereto). Additionally, or alternatively, the merge points canbe generated by the merge point selection system by identifying aninitial point along the nominal path that is within the lane changeregion, and then identifying a plurality of candidate merge points byincrementally adding an interval distance along the nominal path untilthe end of the lane change region has been reached or a certain numberof merge points have been generated.

The merge point selection system can filter the plurality of candidatemerge points to remove any that are unsuitable immediately. To do so,the merge point selection system can order/prioritize the candidatemerge points based on longitudinal distance along the nominal path. Themerge point selection system can use a classifier to immediatelyeliminate some merge points. The classifier can take, as input, thespeed of the autonomous vehicle (v), the curvature of the autonomousvehicle (c), the lateral distance to the target nominal lath (d), and/orthe heading distance between the autonomous vehicle's current headingand the target heading at the candidate merge point (dth). The mergepoint selection system can fit a function regressor (F) such that s=F(d,v, c, dth). If the candidate merge point's longitudinal distance alongthe nominal path is greater than s, the merge point can be retained. Ifnot, the merge point selection system can eliminate the point fromconsideration as being too curvy (e.g., unlikely to result in a drivablebasis path).

Once the plurality of candidate merge points has been filtered, themerge point selection system can generate a fit polynomial for eachremaining candidate merge point. Generating fit polynomials isrelatively cheap in a computational sense and as such, the cost of doingso can be relatively small. For each fit polynomial, the merge pointselection system can determine whether the associated fit polynomialintersects with a lane boundary between the current lane and the targetlane determined lane change region. If not, the merge point can beeliminated from consideration.

In some examples, each candidate merge point that intersects a laneboundary within a determined lane change region, can be selected for usein generating a basis path. In this way, the basis path generationsystem can generate a plurality of potential basis paths. In otherexamples, the merge point selection system can identify one or a smallfixed number of candidate merge points as being the most likelycandidates. Note that if the basis path generation does not include alane change (e.g., the basis path corrects the autonomous vehicle backto the nominal path it was already following) then no merge points aregenerated. Instead, the merge point selection system can select a pointalong the nominal path (s) where s=s0+round-up(F(d, v, c, dth), 1.0)wherein S0 is a point along the current nominal path where theautonomous vehicle is projected to be.

Once one or more merge points have been selected, the geometrymodification system can determine whether the autonomous vehicle will bechanging lanes. In some examples, the basis path generation system hasbeen instructed explicitly to change lanes by another component of thevehicle computing system or a remote service system (e.g. to prepare fora turn or to avoid an obstacle). In other examples, the basis pathgeneration system can determine that a lane change is necessary based onan analysis of the current position of the autonomous vehicle and thelocation of the target nominal path.

In the case where the autonomous vehicle is not changing lanes, thegeometry modification system can alter stored lane boundary data (e.g.,lane boundary offsets) to follow the new path back to the nominal path(e.g., the centerline of the lane). The geometry modification system candetermine a series of points along the proposed basis path from theautonomous vehicle to a point along the nominal path. For each point,the geometry modification system can calculate new lane boundary offsetvalue by extending a ray out perpendicularly from the point on the newpath until it intersects an existing lane boundary. This distance can beset as the new lane boundary offset.

In the case in which the autonomous vehicle is changing lanes, thegeometry modification system can alter stored information about laneboundaries to remove the lane boundaries within the lane change region.New lane offsets can be determined along the one or more basis paths byinserting new lane offset values with a fixed distance (e.g., 2.5meters) that follow along each generated basis path.

Once one or more basis paths have been generated by the basis pathgeneration system, a candidate analysis system can evaluate eachcandidate basis path to determine whether the candidate basis path meetsone or more drivability criteria. Drivability criteria can includelimits on speed, acceleration, turning radius, and so on. The candidateanalysis can select one or more basis paths that meet the drivabilitycriteria.

The one or more basis paths can be transmitted to a spatial pathgenerator. The spatial path generator can generate a plurality oflateral offset profiles. Each lateral offset profile represents adistance to vary from the one or more basis paths. Thus, each basis pathcan have a plurality of associated candidate trajectories that varylaterally from the original basis path based on the values in thelateral offset profile. In addition, a plurality of speed profiles(which describe target speeds for the autonomous vehicle at each pointalong a basis path) can be generated. A plurality of candidatetrajectories can be generated based on different combinations of a basispath, an offset profile, and/or a speed profile.

Once a plurality of candidate trajectories have been generated, eachtrajectory can be assigned a cost based on a plurality of costdetermination functions. The vehicle computing system can select acandidate trajectory with the lowest total cost and implement it asvehicle control commands to control the autonomous vehicle.

The following provides an end-to-end example of the technology describedherein. An autonomous vehicle can include a vehicle computing system.The vehicle computing system can obtain a target nominal path. In someexamples, the target nominal path can be received from a remote serversystem associated with the autonomous vehicle. The vehicle computingsystem can determine a current pose for the autonomous vehicle. Thecurrent pose for an autonomous vehicle can include a current locationand a current heading. The current location of the autonomous vehiclecan be associated with a first lane and the target nominal path can beassociated with a second lane. For example, if the autonomous vehicle ischanging lanes to make a turn, the current lane and the target lane canbe two different lanes. In some examples, a lane boundary separates thefirst lane and the second lane.

The vehicle computing system can determine, based on the current pose ofthe autonomous vehicle and the target nominal path, a lane changeregion. In some examples, the vehicle computing system can determine thelane change region by generating speed data associated with theautonomous vehicle and the target nominal path. The vehicle computingsystem can determine a longitudinal plan based on the speed data. Insome examples, the lane change region can be determined based at leastin part on the longitudinal plan.

The vehicle computing system can determine one or more merge points onthe target nominal path. The vehicle computing system can identify aninitial point along the target nominal path within the lane changeregion. The vehicle computing system can identify a first merge point ata predetermined distance along the target nominal path from the initialpoint.

The vehicle computing system can identify additional merge points bystarting at the first merge point and identifying additional mergepoints along the target nominal path. In some examples, the distanceinterval between the one or more merge points remains constant. Thevehicle computing system can filter the one or more merge points toremove any merge points that fall outside a predetermined thresholddistance from the lane change region.

The vehicle computing system can, for each respective merge point in theone or more merge points, generate a candidate basis path from thecurrent pose of the autonomous vehicle to the respective merge point.The vehicle computing system can generate a suitability classificationfor each candidate basis path.

The vehicle computing system can, for each candidate basis path,determine whether an acceleration rate associated with the candidatebasis path exceeds a predetermined acceleration threshold. Thesuitability classification can be based, at least in part on whether theacceleration rate exceeds a predetermined acceleration threshold. Foreach candidate basis path, the vehicle computing system determineswhether a maximum turning rate for the candidate basis path exceeds apredetermined turning threshold. The suitability classification can bebased, at least in part on whether the maximum turning rate exceeds apredetermined turning threshold. In some examples, the turning rate of acandidate basis path can be measured by the determining a curvature ofthe candidate basis path. To do so, the vehicle computing system cangenerate a polynomial follows the candidate basis path for at least aportion of the line described by the polynomial. The polynomial (e.g., afit polynomial) can be evaluated to determine its curvature and todetermine a first, second, third, and other order derivatives. Thus, ifthe polynomial fit to the path, represents the change in the autonomousvehicles position, a first order derivative can represent its velocity,a second order derivative can represent its acceleration, and so on. Aturning rate threshold can represent a maximum value for the curvatureof a fit polynomial or any of its derivative. In some example, thepredetermined turning threshold or curvature threshold can be based onthe maximum rate that the steering mechanism of the autonomous vehicle(e.g., a steering wheel) can rotate.

The vehicle computing system can select one or more candidate basispaths based at least in part on the suitability classification for eachrespective candidate basis path in the one or more candidate basispaths. The vehicle computing system can generate a plurality ofcandidate trajectories for the autonomous vehicle based on the selectedcandidate basis paths.

The vehicle computing system can determine a cost associated with eachcandidate trajectory in the plurality of candidate trajectories for theautonomous vehicle. The vehicle computing system can select a candidatetrajectory based on the costs associated with the plurality of candidatetrajectories for the autonomous vehicle. The vehicle computing systemcan convert the selected candidate trajectory into one or more vehiclecontrols for implementation by the autonomous vehicle.

Various means can be configured to perform the methods and processesdescribed herein. For example, a computing system can include pathobtaining units(s), pose determination units(s), region identificationunits(s), merge point determination units(s), path generation units(s),classification units(s), selection units(s), and/or other means forperforming the operations and functions described herein. In someimplementations, one or more of the units may be implemented separately.In some implementations, one or more units may be a part of or includedin one or more other units. These means can include processor(s),microprocessor(s), graphics processing unit(s), logic circuit(s),dedicated circuit(s), application-specific integrated circuit(s),programmable array logic, field-programmable gate array(s),controller(s), microcontroller(s), and/or other suitable hardware. Themeans can also, or alternately, include software control meansimplemented with a processor or logic circuitry for example. The meanscan include or otherwise be able to access memory such as, for example,one or more non-transitory computer-readable storage media, such asrandom-access memory, read-only memory, electrically erasableprogrammable read-only memory, erasable programmable read-only memory,flash/other memory device(s), data registrar(s), database(s), and/orother suitable hardware.

The means can be programmed to perform one or more algorithm(s) forcarrying out the operations and functions described herein. Forinstance, the means can be configured to obtain a target nominal path.For example, a vehicle computing system can access target nominal pathdata from a map database stored in an accessible computing system. Apath obtaining unit is one example of a means for obtaining a targetnominal path.

The means can be configured to determine a current pose for theautonomous vehicle. For example, the vehicle computing system candetermine the location, speed, and heading of the autonomous vehicle. Apose determination unit is one example of a means for determining acurrent pose for the autonomous vehicle.

The means can be configured to determine, based on the current pose ofthe autonomous vehicle and the target nominal path, a lane changeregion. For example, the vehicle computing system can determine aspecific distance along a lane at which a lane change region begins andends based on the characteristics of the lane and the speed and pose ofthe autonomous vehicle. A region identification unit is one example of ameans for determining, based on the current pose of the autonomousvehicle and the target nominal path, a lane change region.

The means can be configured to determine one or more merge points on thetarget nominal path. For example, the vehicle computing system canidentify a series of coordinates that make up the nominal path. Thevehicle computing system can identify each coordinate from the nominalpath that falls within the lane change region as potential merge points.The potential merge points can be filtered to remove any unsuitablemerge points. A merge point determination unit is one example of a meansfor determining one or more merge points on the target nominal path.

The means can be configured to, for each respective merge point in theone or more merge points, generate a candidate basis path from thecurrent pose of the autonomous vehicle to the respective merge point.For example, the vehicle computing system can plan a path from theautonomous vehicle to each candidate merge point. A path generation unitis one example of a means for, for each respective merge point in theone or more merge points, generating a candidate basis path from thecurrent pose of the autonomous vehicle to the respective merge point.

The means can be configured to generate a suitability classification foreach candidate basis path. For example, the vehicle computing system canevaluate a maximum acceleration rate, speed, and/or turning rate for thecandidate basis path. A classification unit is one example of a meansfor generating a suitability classification for each candidate basispath.

The means can be configured to select a candidate basis path based onthe suitability classification for each respective candidate basis pathin the one or more candidate basis paths. For example, the vehiclecomputing system can choose the basis path that is the most suitable forreaching a point on the target nominal path. A selection unit is oneexample of a means for selecting a candidate basis path based on thesuitability classification for each respective candidate basis path inthe one or more candidate basis paths.

The systems and methods described herein provide a number of technicaleffects and benefits. More particularly, the systems and methods of thepresent disclosure provide improved techniques for performing the pathplanning functions associated with an autonomous vehicle. Specifically,a basis path generation system that generates basis paths for use in thepath planning system as described above can allow the autonomous vehicleto more efficiently travel through an environment and safely react toevents and/or obstacles. As a result, the path planning system can moreefficiently plan paths and select appropriate trajectories. This resultsin a reduction in the number of processing cycles necessary, reducingthe amount of data storage needed, and reducing the amount of energyused by the system. Reducing energy consumption also increases theuseful battery life of any battery systems included in the autonomousvehicle.

With reference to the figures, example embodiments of the presentdisclosure will be discussed in further detail.

FIG. 1 depicts a block diagram of an example system 100 for controllingand communicating with a vehicle according to example aspects of thepresent disclosure. As illustrated, FIG. 1 shows a system 100 that caninclude a vehicle 105 and a vehicle computing system 110 associated withthe vehicle 105. The vehicle computing system 100 can be located onboardthe vehicle 105 (e.g., it can be included on and/or within the vehicle105).

The vehicle 105 incorporating the vehicle computing system 100 can bevarious types of vehicles. For instance, the vehicle 105 can be anautonomous vehicle. The vehicle 105 can be a ground-based autonomousvehicle (e.g., car, truck, bus, etc.). The vehicle 105 can be anair-based autonomous vehicle (e.g., airplane, helicopter, verticaltake-off and lift (VTOL) aircraft, etc.). The vehicle 105 can be alightweight elective vehicle (e.g., bicycle, scooter, etc.). The vehicle105 can be another type of vehicle (e.g., watercraft, etc.). The vehicle105 can drive, navigate, operate, etc. with minimal and/or nointeraction from a human operator (e.g., driver, pilot, etc.). In someimplementations, a human operator can be omitted from the vehicle 105(and/or also omitted from remote control of the vehicle 105). In someimplementations, a human operator can be included in the vehicle 105.

The vehicle 105 can be configured to operate in a plurality of operatingmodes. The vehicle 105 can be configured to operate in a fullyautonomous (e.g., self-driving) operating mode in which the vehicle 105is controllable without user input (e.g., can drive and navigate with noinput from a human operator present in the vehicle 105 and/or remotefrom the vehicle 105). The vehicle 105 can operate in a semi-autonomousoperating mode in which the vehicle 105 can operate with some input froma human operator present in the vehicle 105 (and/or a human operatorthat is remote from the vehicle 105). The vehicle 105 can enter into amanual operating mode in which the vehicle 105 is fully controllable bya human operator (e.g., human driver, pilot, etc.) and can be prohibitedand/or disabled (e.g., temporary, permanently, etc.) from performingautonomous navigation (e.g., autonomous driving, flying, etc.). Thevehicle 105 can be configured to operate in other modes such as, forexample, park and/or sleep modes (e.g., for use between tasks/actionssuch as waiting to provide a vehicle service, recharging, etc.). In someimplementations, the vehicle 105 can implement vehicle operatingassistance technology (e.g., collision mitigation system, power assiststeering, etc.), for example, to help assist the human operator of thevehicle 105 (e.g., while in a manual mode, etc.).

To help maintain and switch between operating modes, the vehiclecomputing system 110 can store data indicative of the operating modes ofthe vehicle 105 in a memory onboard the vehicle 105. For example, theoperating modes can be defined by an operating mode data structure(e.g., rule, list, table, etc.) that indicates one or more operatingparameters for the vehicle 105, while in the particular operating mode.For example, an operating mode data structure can indicate that thevehicle 105 is to autonomously plan its motion when in the fullyautonomous operating mode. The vehicle computing system 110 can accessthe memory when implementing an operating mode.

The operating mode of the vehicle 105 can be adjusted in a variety ofmanners. For example, the operating mode of the vehicle 105 can beselected remotely, off-board the vehicle 105. For example, a remotecomputing system (e.g., of a vehicle provider and/or service entityassociated with the vehicle 105) can communicate data to the vehicle 105instructing the vehicle 105 to enter into, exit from, maintain, etc. anoperating mode. By way of example, such data can instruct the vehicle105 to enter into the fully autonomous operating mode.

In some implementations, the operating mode of the vehicle 105 can beset onboard and/or near the vehicle 105. For example, the vehiclecomputing system 110 can automatically determine when and where thevehicle 105 is to enter, change, maintain, etc. a particular operatingmode (e.g., without user input). Additionally, or alternatively, theoperating mode of the vehicle 105 can be manually selected via one ormore interfaces located onboard the vehicle 105 (e.g., key switch,button, etc.) and/or associated with a computing device proximate to thevehicle 105 (e.g., a tablet operated by authorized personnel locatednear the vehicle 105). In some implementations, the operating mode ofthe vehicle 105 can be adjusted by manipulating a series of interfacesin a particular order to cause the vehicle 105 to enter into aparticular operating mode.

The vehicle computing system 110 can include one or more computingdevices located onboard the vehicle 105. For example, the computingdevice(s) can be located on and/or within the vehicle 105. The computingdevice(s) can include various components for performing variousoperations and functions. For instance, the computing device(s) caninclude one or more processors and one or more tangible, non-transitory,computer readable media (e.g., memory devices, etc.). The one or moretangible, non-transitory, computer readable media can store instructionsthat when executed by the one or more processors cause the vehicle 105(e.g., its computing system, one or more processors, etc.) to performoperations and functions, such as those described herein for controllingan autonomous vehicle, communicating with other computing systems, etc.

The vehicle 105 can include a communications system 115 configured toallow the vehicle computing system 110 (and its computing device(s)) tocommunicate with other computing devices. The communications system 115can include any suitable components for interfacing with one or morenetwork(s) 120, including, for example, transmitters, receivers, ports,controllers, antennas, and/or other suitable components that can helpfacilitate communication. In some implementations, the communicationssystem 115 can include a plurality of components (e.g., antennas,transmitters, and/or receivers) that allow it to implement and utilizemultiple-input, multiple-output (MIMO) technology and communicationtechniques.

The vehicle computing system 110 can use the communications system 115to communicate with one or more computing device(s) that are remote fromthe vehicle 105 over one or more networks 120 (e.g., via one or morewireless signal connections). The network(s) 120 can exchange (send orreceive) signals (e.g., electronic signals), data (e.g., data from acomputing device), and/or other information and include any combinationof various wired (e.g., twisted pair cable) and/or wirelesscommunication mechanisms (e.g., cellular, wireless, satellite,microwave, and radio frequency) and/or any desired network topology (ortopologies). For example, the network(s) 120 can include a local areanetwork (e.g. intranet), wide area network (e.g. Internet), wireless LANnetwork (e.g., via Wi-Fi), cellular network, a SATCOM network, VHFnetwork, a HF network, a WiMAX based network, and/or any other suitablecommunication network (or combination thereof) for transmitting data toand/or from the vehicle 105 and/or among computing systems.

In some implementations, the communications system 115 can also beconfigured to enable the vehicle 105 to communicate with and/or provideand/or receive data and/or signals from a remote computing deviceassociated with a user 125 and/or an item (e.g., an item to be picked-upfor a courier service). For example, the communications system 115 canallow the vehicle 105 to locate and/or exchange communications with auser device 130 of a user 125. In some implementations, thecommunications system 115 can allow communication among one or more ofthe system(s) on-board the vehicle 105.

As shown in FIG. 1 , the vehicle 105 can include one or more sensors135, an autonomy computing system 140, a vehicle interface 145, one ormore vehicle control systems 150, and other systems, as describedherein. One or more of these systems can be configured to communicatewith one another via one or more communication channels. Thecommunication channel(s) can include one or more data buses (e.g.,controller area network (CAN)), on-board diagnostics connector (e.g.,OBD-II), and/or a combination of wired and/or wireless communicationlinks. The onboard systems can send and/or receive data, messages,signals, etc. amongst one another via the communication channel(s).

The sensor(s) 135 can be configured to acquire sensor data 155. Thesensor(s) 135 can be external sensors configured to acquire externalsensor data. This can include sensor data associated with thesurrounding environment of the vehicle 105. The surrounding environmentof the vehicle 105 can include/be represented in the field of view ofthe sensor(s) 135. For instance, the sensor(s) 135 can acquire imageand/or other data of the environment outside of the vehicle 105 andwithin a range and/or field of view of one or more of the sensor(s) 135.The sensor(s) 135 can include one or more Light Detection and Ranging(LIDAR) systems, one or more Radio Detection and Ranging (RADAR)systems, one or more cameras (e.g., visible spectrum cameras, infraredcameras, etc.), one or more motion sensors, one or more audio sensors(e.g., microphones, etc.), and/or other types of imaging capture devicesand/or sensors. The one or more sensors can be located on various partsof the vehicle 105 including a front side, rear side, left side, rightside, top, and/or bottom of the vehicle 105. The sensor data 155 caninclude image data (e.g., 2D camera data, video data, etc.), RADAR data,LIDAR data (e.g., 3D point cloud data, etc.), audio data, and/or othertypes of data. The vehicle 105 can also include other sensors configuredto acquire data associated with the vehicle 105. For example, thevehicle 105 can include inertial measurement unit(s), wheel odometrydevices, and/or other sensors.

In some implementations, the sensor(s) 135 can include one or moreinternal sensors. The internal sensor(s) can be configured to acquiresensor data 155 associated with the interior of the vehicle 105. Forexample, the internal sensor(s) can include one or more cameras, one ormore infrared sensors, one or more motion sensors, one or more weightsensors (e.g., in a seat, in a trunk, etc.), and/or other types ofsensors. The sensor data 155 acquired via the internal sensor(s) caninclude, for example, image data indicative of a position of a passengeror item located within the interior (e.g., cabin, trunk, etc.) of thevehicle 105. This information can be used, for example, to ensure thesafety of the passenger, to prevent an item from being left by apassenger, confirm the cleanliness of the vehicle 105, remotely assist apassenger, etc.

In some implementations, the sensor data 155 can be indicative of one ormore objects within the surrounding environment of the vehicle 105. Theobject(s) can include, for example, vehicles, pedestrians, bicycles,and/or other objects. The object(s) can be located in front of, to therear of, to the side of, above, below the vehicle 105, etc. The sensordata 155 can be indicative of locations associated with the object(s)within the surrounding environment of the vehicle 105 at one or moretimes. The object(s) can be static objects (e.g., not in motion) and/ordynamic objects/actors (e.g., in motion or likely to be in motion) inthe vehicle's environment. The sensor(s) 135 can provide the sensor data155 to the autonomy computing system 140.

In addition to the sensor data 155, the autonomy computing system 140can obtain map data 160. The map data 160 can provide detailedinformation about the surrounding environment of the vehicle 105 and/orthe geographic area in which the vehicle was, is, and/or will belocated. For example, the map data 160 can provide informationregarding: the identity and location of different roadways, roadsegments, buildings, or other items or objects (e.g., lampposts,crosswalks and/or curb); the location and directions of traffic lanes(e.g., the location and direction of a parking lane, a turning lane, abicycle lane, or other lanes within a particular roadway or other travelway and/or one or more boundary markings associated therewith); trafficcontrol data (e.g., the location and instructions of signage, trafficlights, and/or other traffic control devices); obstruction information(e.g., temporary or permanent blockages, etc.); event data (e.g., roadclosures/traffic rule alterations due to parades, concerts, sportingevents, etc.); nominal vehicle path data (e.g., indicate of an idealvehicle path such as along the center of a certain lane, etc.); and/orany other map data that provides information that assists the vehiclecomputing system 110 in processing, analyzing, and perceiving itssurrounding environment and its relationship thereto. In someimplementations, the map data 160 can include high definition map data.In some implementations, the map data 160 can include sparse map dataindicative of a limited number of environmental features (e.g., laneboundaries, etc.). In some implementations, the map data can be limitedto geographic area(s) and/or operating domains in which the vehicle 105(or autonomous vehicles generally) may travel (e.g., due tolegal/regulatory constraints, autonomy capabilities, and/or otherfactors).

The vehicle 105 can include a positioning system 165. The positioningsystem 165 can determine a current position of the vehicle 105. This canhelp the vehicle 105 localize itself within its environment. Thepositioning system 165 can be any device or circuitry for analyzing theposition of the vehicle 105. For example, the positioning system 165 candetermine position by using one or more of inertial sensors (e.g.,inertial measurement unit(s), etc.), a satellite positioning system,based on IP address, by using triangulation and/or proximity to networkaccess points or other network components (e.g., cellular towers, WIFIaccess points, etc.) and/or other suitable techniques. The position ofthe vehicle 105 can be used by various systems of the vehicle computingsystem 110 and/or provided to a remote computing system. For example,the map data 160 can provide the vehicle 105 relative positions of theelements of a surrounding environment of the vehicle 105. The vehicle105 can identify its position within the surrounding environment (e.g.,across six axes, etc.) based at least in part on the map data 160. Forexample, the vehicle computing system 110 can process the sensor data155 (e.g., LIDAR data, camera data, etc.) to match it to a map of thesurrounding environment to get an understanding of the vehicle'sposition within that environment. Data indicative of the vehicle'sposition can be stored, communicated to, and/or otherwise obtained bythe autonomy computing system 140.

The autonomy computing system 140 can perform various functions forautonomously operating the vehicle 105. For example, the autonomycomputing system 140 can perform the following functions: perception170A, prediction 170B, and motion planning 170C. For example, theautonomy computing system 140 can obtain the sensor data 155 via thesensor(s) 135, process the sensor data 155 (and/or other data) toperceive its surrounding environment, predict the motion of objectswithin the surrounding environment, and generate an appropriate motionplan through such surrounding environment. In some implementations,these autonomy functions can be performed by one or more sub-systemssuch as, for example, a perception system, a prediction system, a motionplanning system, and/or other systems that cooperate to perceive thesurrounding environment of the vehicle 105 and determine a motion planfor controlling the motion of the vehicle 105 accordingly. In someimplementations, one or more of the perception, prediction, and/ormotion planning functions 170A, 170B, 170C can be performed by (and/orcombined into) the same system and/or via shared computing resources. Insome implementations, one or more of these functions can be performedvia different sub-systems. As further described herein, the autonomycomputing system 140 can communicate with the one or more vehiclecontrol systems 150 to operate the vehicle 105 according to the motionplan (e.g., via the vehicle interface 145, etc.).

The vehicle computing system 110 (e.g., the autonomy computing system140) can identify one or more objects within the surrounding environmentof the vehicle 105 based at least in part on the sensor data from thesensors 135 and/or the map data 160. The objects perceived within thesurrounding environment can be those within the field of view of thesensor(s) 135 and/or predicted to be occluded from the sensor(s) 135.This can include object(s) not in motion or not predicted to move(static objects) and/or object(s) in motion or predicted to be in motion(dynamic objects/actors). The vehicle computing system 110 (e.g.,performing the perception function 170C, using a perception system,etc.) can process the sensor data 155, the map data 160, etc. to obtainperception data 175A. The vehicle computing system 110 can generateperception data 175A that is indicative of one or more states (e.g.,current and/or past state(s)) of one or more objects that are within asurrounding environment of the vehicle 105. For example, the perceptiondata 175A for each object can describe (e.g., for a given time, timeperiod) an estimate of the object's: current and/or past location (alsoreferred to as position); current and/or past speed/velocity; currentand/or past acceleration; current and/or past heading; current and/orpast orientation; size/footprint (e.g., as represented by a boundingshape, object highlighting, etc.); class (e.g., pedestrian class vs.vehicle class vs. bicycle class, etc.), the uncertainties associatedtherewith, and/or other state information. The vehicle computing system110 can utilize one or more algorithms and/or machine-learned model(s)that are configured to identify object(s) based at least in part on thesensor data 155. This can include, for example, one or more neuralnetworks trained to identify object(s) within the surroundingenvironment of the vehicle 105 and the state data associated therewith.The perception data 175A can be utilized for the prediction function170B of the autonomy computing system 140.

The vehicle computing system 110 can be configured to predict a motionof the object(s) within the surrounding environment of the vehicle 105.For instance, the vehicle computing system 110 can generate predictiondata 175B associated with such object(s). The prediction data 175B canbe indicative of one or more predicted future locations of eachrespective object. For example, the prediction system 170B can determinea predicted motion trajectory along which a respective object ispredicted to travel over time. A predicted motion trajectory can beindicative of a path that the object is predicted to traverse and anassociated timing with which the object is predicted to travel along thepath. The predicted path can include and/or be made up of a plurality ofway points. In some implementations, the prediction data 175B can beindicative of the speed and/or acceleration at which the respectiveobject is predicted to travel along its associated predicted motiontrajectory. The vehicle computing system 110 can utilize one or morealgorithms and/or machine-learned model(s) that are configured topredict the future motion of object(s) based at least in part on thesensor data 155, the perception data 175A, map data 160, and/or otherdata. This can include, for example, one or more neural networks trainedto predict the motion of the object(s) within the surroundingenvironment of the vehicle 105 based at least in part on the past and/orcurrent state(s) of those objects as well as the environment in whichthe objects are located (e.g., the lane boundary in which it istravelling, etc.). The prediction data 175B can be utilized for themotion planning function 170C of the autonomy computing system 140.

The vehicle computing system 110 can determine a motion plan for thevehicle 105 based at least in part on the perception data 175A, theprediction data 175B, and/or other data. For example, the vehiclecomputing system 110 can generate motion planning data 175C indicativeof a motion plan. The motion plan can include vehicle actions (e.g.,speed(s), acceleration(s), other actions, etc.) with respect to one ormore of the objects within the surrounding environment of the vehicle105 as well as the objects' predicted movements. The motion plan caninclude one or more vehicle motion trajectories that indicate a path forthe vehicle 105 to follow. A vehicle motion trajectory can be of acertain length and/or time range. A vehicle motion trajectory can bedefined by one or more waypoints (with associated coordinates). Theplanned vehicle motion trajectories can indicate the path the vehicle105 is to follow as it traverses a route from one location to another.Thus, the vehicle computing system 110 can consider a route/route datawhen performing the motion planning function 170C.

The motion planning function 170C can implement an optimizationalgorithm, machine-learned model, etc. that considers cost dataassociated with a vehicle action as well as other objective functions(e.g., cost functions based on speed limits, traffic lights, etc.), ifany, to determine optimized variables that make up the motion plan. Thevehicle computing system 110 can determine that the vehicle 105 canperform a certain action (e.g., pass an object, etc.) without increasingthe potential risk to the vehicle 105 and/or violating any traffic laws(e.g., speed limits, lane boundaries, signage, etc.). For instance, thevehicle computing system 110 can evaluate the predicted motiontrajectories of one or more objects during its cost data analysis tohelp determine an optimized vehicle trajectory through the surroundingenvironment. The motion planning function 170C can generate cost dataassociated with such trajectories. In some implementations, one or moreof the predicted motion trajectories and/or perceived objects may notultimately change the motion of the vehicle 105 (e.g., due to anoverriding factor). In some implementations, the motion plan may definethe vehicle's motion such that the vehicle 105 avoids the object(s),reduces speed to give more leeway to one or more of the object(s),proceeds cautiously, performs a stopping action, passes an object,queues behind/in front of an object, etc.

The vehicle computing system 110 can be configured to continuouslyupdate the vehicle's motion plan and a corresponding planned vehiclemotion trajectory. For example, in some implementations, the vehiclecomputing system 110 can generate new motion planning data 175C/motionplan(s) for the vehicle 105 (e.g., multiple times per second, etc.).Each new motion plan can describe a motion of the vehicle 105 over thenext planning period (e.g., next several seconds, etc.). Moreover, a newmotion plan may include a new planned vehicle motion trajectory. Thus,in some implementations, the vehicle computing system 110 cancontinuously operate to revise or otherwise generate a short-term motionplan based on the currently available data. Once the optimizationplanner has identified the optimal motion plan (or some other iterativebreak occurs), the optimal motion plan (and the planned motiontrajectory) can be selected and executed by the vehicle 105.

The vehicle computing system 110 can cause the vehicle 105 to initiate amotion control in accordance with at least a portion of the motionplanning data 175C. A motion control can be an operation, action, etc.that is associated with controlling the motion of the vehicle 105. Forinstance, the motion planning data 175C can be provided to the vehiclecontrol system(s) 150 of the vehicle 105. The vehicle control system(s)150 can be associated with a vehicle interface 145 that is configured toimplement a motion plan. The vehicle interface 145 can serve as aninterface/conduit between the autonomy computing system 140 and thevehicle control systems 150 of the vehicle 105 and anyelectrical/mechanical controllers associated therewith. The vehicleinterface 145 can, for example, translate a motion plan intoinstructions for the appropriate vehicle control component (e.g.,acceleration control, brake control, steering control, etc.). By way ofexample, the vehicle interface 145 can translate a determined motionplan into instructions to adjust the steering of the vehicle 105 “X”degrees, apply a certain magnitude of braking force, increase/decreasespeed, etc. The vehicle interface 145 can help facilitate theresponsible vehicle control (e.g., braking control system, steeringcontrol system, acceleration control system, etc.) to execute theinstructions and implement a motion plan (e.g., by sending controlsignal(s), making the translated plan available, etc.). This can allowthe vehicle 105 to autonomously travel within the vehicle's surroundingenvironment.

The vehicle computing system 110 can store other types of data. Forexample, an indication, record, and/or other data indicative of thestate of the vehicle (e.g., its location, motion trajectory, healthinformation, etc.), the state of one or more users (e.g., passengers,operators, etc.) of the vehicle, and/or the state of an environmentincluding one or more objects (e.g., the physical dimensions and/orappearance of the one or more objects, locations, predicted motion,etc.) can be stored locally in one or more memory devices of the vehicle105. Additionally, the vehicle 105 can communicate data indicative ofthe state of the vehicle, the state of one or more passengers of thevehicle, and/or the state of an environment to a computing system thatis remote from the vehicle 105, which can store such information in oneor more memories remote from the vehicle 105. Moreover, the vehicle 105can provide any of the data created and/or store onboard the vehicle 105to another vehicle.

The vehicle computing system 110 can include the one or more vehicleuser devices 180. For example, the vehicle computing system 110 caninclude one or more user devices with one or more display deviceslocated onboard the vehicle 105. A display device (e.g., screen of atablet, laptop, and/or smartphone) can be viewable by a user of thevehicle 105 that is located in the front of the vehicle 105 (e.g.,driver's seat, front passenger seat). Additionally, or alternatively, adisplay device can be viewable by a user of the vehicle 105 that islocated in the rear of the vehicle 105 (e.g., a back-passenger seat).The user device(s) associated with the display devices can be any typeof user device such as, for example, a table, mobile phone, laptop, etc.The vehicle user device(s) 180 can be configured to function ashuman-machine interfaces. For example, the vehicle user device(s) 180can be configured to obtain user input, which can then be utilized bythe vehicle computing system 110 and/or another computing system (e.g.,a remote computing system, etc.). For example, a user (e.g., a passengerfor transportation service, a vehicle operator, etc.) of vehicle 105 canprovide user input to adjust a destination location of vehicle 105. Thevehicle computing system 110 and/or another computing system can updatethe destination location of the vehicle 105 and the route associatedtherewith to reflect the change indicated by the user input.

The vehicle 105 can be configured to perform vehicle services for one ora plurality of different service entities 185. A vehicle 105 can performa vehicle service by, for example and as further described herein,travelling (e.g., traveling autonomously) to a location associated witha requested vehicle service, allowing user(s) and/or item(s) to board orotherwise enter the vehicle 105, transporting the user(s) and/oritem(s), allowing the user(s) and/or item(s) to deboard or otherwiseexit the vehicle 105, etc. In this way, the vehicle 105 can provide thevehicle service(s) for a service entity to a user.

A service entity 185 can be associated with the provision of one or morevehicle services. For example, a service entity can be an individual, agroup of individuals, a company (e.g., a business entity, organization,etc.), a group of entities (e.g., affiliated companies), and/or anothertype of entity that offers and/or coordinates the provision of one ormore vehicle services to one or more users. For example, a serviceentity can offer vehicle service(s) to users via one or more softwareapplications (e.g., that are downloaded onto a user computing device),via a website, and/or via other types of interfaces that allow a user torequest a vehicle service. As described herein, the vehicle services caninclude transportation services (e.g., by which a vehicle transportsuser(s) from one location to another), delivery services (e.g., by whicha vehicle transports/delivers item(s) to a requested destinationlocation), courier services (e.g., by which a vehicle retrieves item(s)from a requested origin location and transports/delivers the item to arequested destination location), and/or other types of services. Thevehicle services can be wholly performed by the vehicle 105 (e.g.,travelling from the user/item origin to the ultimate destination, etc.)or performed by one or more vehicles and/or modes of transportation(e.g., transferring the user/item at intermediate transfer points,etc.).

An operations computing system 190A of the service entity 185 can helpto coordinate the performance of vehicle services by autonomousvehicles. The operations computing system 190A can include and/orimplement one or more service platforms of the service entity. Theoperations computing system 190A can include one or more computingdevices. The computing device(s) can include various components forperforming various operations and functions. For instance, the computingdevice(s) can include one or more processors and one or more tangible,non-transitory, computer readable media (e.g., memory devices, etc.).The one or more tangible, non-transitory, computer readable media canstore instructions that when executed by the one or more processorscause the operations computing system 190A (e.g., it's one or moreprocessors, etc.) to perform operations and functions, such as thosedescribed herein matching users and vehicles/vehicle fleets, deployingvehicles, facilitating the provision of vehicle services via autonomousvehicles, etc.

A user 125 can request a vehicle service from a service entity 185. Forexample, the user 125 can provide user input to a user device 130 torequest a vehicle service (e.g., via a user interface associated with amobile software application of the service entity 185 running on theuser device 130). The user device 130 can communicate data indicative ofa vehicle service request 195 to the operations computing system 190Aassociated with the service entity 185 (and/or another associatedcomputing system that can then communicate data to the operationscomputing system 190A). The vehicle service request 195 can beassociated with a user. The associated user can be the one that submitsthe vehicle service request (e.g., via an application on the user device130). In some implementations, the user may not be the user that submitsthe vehicle service request. The vehicle service request can beindicative of the user. For example, the vehicle service request caninclude an identifier associated with the user and/or the user'sprofile/account with the service entity 185. The vehicle service request195 can be generated in a manner that avoids the use of personallyidentifiable information and/or allows the user to control the types ofinformation included in the vehicle service request 195. The vehicleservice request 195 can also be generated, communicated, stored, etc. ina secure manner to protect information.

The vehicle service request 195 can indicate various types ofinformation. For example, the vehicle service request 195 can indicatethe type of vehicle service that is desired (e.g., a transportationservice, a delivery service, a courier service, etc.), one or morelocations (e.g., an origin location, a destination location, etc.),timing constraints (e.g., pick-up time, drop-off time, deadlines, etc.),and/or geographic constraints (e.g., to stay within a certain area,etc.). The service request 195 can indicate a type/size/class of vehiclesuch as, for example, a sedan, an SUV, luxury vehicle, standard vehicle,etc. The service request 195 can indicate a product of the serviceentity 185. For example, the service request 195 can indicate that theuser is requesting a transportation pool product by which the user wouldpotentially share the vehicle (and costs) with other users/items. Insome implementations, the service request 195 can explicitly request forthe vehicle service to be provided by an autonomous vehicle or ahuman-driven vehicle. In some implementations, the service request 195can indicate a number of users that will be riding in thevehicle/utilizing the vehicle service. In some implementations, theservice request 195 can indicate preferences/special accommodations ofan associated user (e.g., music preferences, climate preferences,wheelchair accessibility, etc.) and/or other information.

The operations computing system 190A of the service entity 185 canprocess the data indicative of the vehicle service request 195 andgenerate a vehicle service assignment that is associated with thevehicle service request. The operations computing system can identifyone or more vehicles that may be able to perform the requested vehicleservices to the user 195. The operations computing system 190A canidentify which modes of transportation are available to a user for therequested vehicle service (e.g., light electric vehicles, human-drivevehicles, autonomous vehicles, aerial vehicle, etc.) and/or the numberof transportation modes/legs of a potential itinerary of the user forcompleting the vehicle service (e.g., single or plurality of modes,single or plurality of legs, etc.). For example, the operationscomputing system 190A can determined which autonomous vehicle(s) areonline with the service entity 185 (e.g., available for a vehicleservice assignment, addressing a vehicle service assignment, etc.) tohelp identify which autonomous vehicle(s) would be able to provide thevehicle service.

The operations computing system 190A and/or the vehicle computing system110 can communicate with one or more other computing systems 190B thatare remote from the vehicle 105. This can include, for example,computing systems associated with government functions (e.g., emergencyservices, regulatory bodies, etc.), computing systems associated withvehicle providers other than the service entity, computing systems ofother vehicles (e.g., other autonomous vehicles, aerial vehicles, etc.).Communication with the other computing systems 190B can occur via thenetwork(s) 120.

FIG. 2A depicts a diagram of an example computing system 200 includingone or more of the plurality of devices (e.g., plurality of devices205A-N) of the computing system of the present disclosure. The pluralityof devices 205A-N can include one or more devices configured tocommunicate over one or more wired and/or wireless communicationchannels (e.g., wired and/or wireless networks). Each device (e.g.,205A) can be associated with a type, an operating system 250, and/or oneor more designated tasks. A type, for example, can include an indicationof the one or more designated tasks of a respective device 205A. The oneor more designated tasks, for example, can include performing one ormore processes 220A-N and/or services of the computing system 200.

Each device 205A of the plurality of devices 205A-N can include and/orhave access to one or more processors 255 and/or one or more memories260 (e.g., RAM memory, ROM memory, cache memory, flash memory, etc.).The one or more memories 260 can include one or more tangiblenon-transitory computer readable instructions that, when executed by theone or more processors 255, cause the device 205A to perform one or moreoperations. The operations can include, for example, executing one ormore of a plurality of processes of the computing system 200. Forinstance, each device 205A can include a compute node configured to runone or more processes 220A-N of the plurality of processes.

For example, the device 205A can include an orchestration service 210.The orchestration service 210 can include a start-up process of thedevice 205A. The orchestration service 210, for example, can include anoperating system service (e.g., a service running as part of theoperating system 250). In addition, or alternatively, the orchestrationservice can include a gRPC service. The device 205A can run theorchestration service 210 to configure and start processes 220A-220N ofthe device 205A. In some implementations, the orchestration service 210can include a primary orchestrator and/or at least one of a plurality ofsecondary orchestrators. For example, each respective device of theplurality of devices can include at least one of the plurality ofsecondary orchestrators. The primary orchestrator can be configured toreceive global configuration data and provide the global configurationdata to the plurality of secondary orchestrators. The globalconfiguration data, for example, can include one or more instructionsindicative of the one or more designated tasks for each respectivedevice(s) 205A-N, a software version and/or environment on which to runa plurality of processes (e.g., 220A-220N of the device 205A) of thecomputing system 200, etc. A secondary orchestrator for each respectivedevice can receive the global configuration data and configure and startone or more processes at the respective device based on the globalconfiguration data.

For instance, each process (e.g., process 220A, 220B) can include aplurality of function nodes 235 (e.g., pure functions) connected by oneor more directed edges that dictate the flow of data between theplurality of function nodes 235. Each device 205A can execute (e.g., viaone or more processors, etc.) a respective plurality of function nodes235 to run a respective process 220A, 220B. For example, the pluralityof function nodes 235 can be arranged in one or more function graphs225. A function graph 225 can include a plurality of (e.g., series of)function nodes 235 arranged (e.g., by one or more directed edges) in apipeline, graph architecture, etc.

For example, with reference to FIG. 2B, FIG. 2B depicts a diagram of anexample functional graph 225 according to example implementations of thepresent disclosure. The function graph 225 can include a plurality offunction nodes 235A-F, one or more injector nodes 230A-B, one or moreejector nodes 240A-B, and/or one or more directed edges 245. Thefunction nodes 235 can include one or more computing functions with oneor more inputs (e.g., of one or more data types) and one or more outputs(e.g., of one or more data types). For example, the function nodes235A-F can be implemented such that they define one or more acceptedinputs and one or more outputs. In some implementations, each functionnode 235A-F can be configured to obtain one or more inputs of a singledata type, perform one or more functions on the one or more inputs, andoutput one or more outputs of a single data type.

Each function node of the plurality of function nodes 235A-F can bearranged in a directed graph architecture (e.g., including a pluralityof function graphs) and can be configured to obtain function input dataassociated with an autonomous vehicle based on the one or more directededges 245 (e.g., of the directed graph 225). For instance, the functionnodes 235A-F can be connected by one or more directed edges 245 of thefunction graph 225 (and/or a subgraph 225A, 225B of the function graph225 with reference to FIG. 2A). The one or more directed edges 245 candictate how data flows through the function graph 225 (and/or thesubgraphs 225A, 225B of FIG. 2A). For example, the one or more directededges 245 can be formed based on the defined inputs and outputs of eachof the function nodes 235A-F of the function graph 225. The functionnodes 235A-F can generate function output data based on the functioninput data. For instance, the function nodes 235A-F can perform one ormore functions of the autonomous vehicle on the function input data toobtain the function output data. The function nodes 235A-F cancommunicate the function output data to one or more other function nodesof the plurality of function nodes 235A-F based on the one or moredirected edges 245 of the directed graph 225.

In addition, or alternatively, each function graph 225 can include oneor more injector nodes 230A-B and one or more ejector nodes 220A-Bconfigured to communicate with one or more remote devices and/orprocesses (e.g., processes 220C-220N of FIG. 2A) outside the functiongraph 225. The injector nodes 230A-B, for example, can be configured tocommunicate with one or more devices and/or processes (e.g., processes220C-220N of FIG. 2A) outside the function graph 225 to obtain inputdata for the function graph 225. By way of example, each of the one ormore injector nodes 230A-B can include a function configured to obtainand/or process sensor data from a respective sensor 280 shown in FIG. 2A(e.g., sensor(s) 135 of FIG. 1 ). The ejector nodes 240A-B can beconfigured to communicate with one or more devices 205B-N and/orprocesses 220C-220N outside the function graph 225 to provide functionoutput data of the function graph 225 to the one or more devices 205B-Nand/or processes 220C-220N.

Turning back to FIG. 2A, each device 205A-N can be configured to executeone or more function graphs 225 to run one or more processes 220A, 220Bof the plurality of processes 220A-N of the respective device 205A. Forexample, as described herein, each respective device can be configuredto run a respective set of processes based on global configuration data.Each process 220A-N can include an executed instance of a function graphand/or a subgraph of a function graph. For example, in someimplementations, a function graph 225 can be separated across multipleprocesses 220A, 220B. Each process 220A, 220B can include a subgraph225A, 225B (e.g., process 220A including subgraph 225A, process 220Bincluding subgraph 225B, etc.) of the function graph 225. In such acase, each process 220A, 220B of the function graph 225 can becommunicatively connected by one or more function nodes 235 of thefunction graph 225. In this manner, each respective device 205A-N can beconfigured to run a respective process by executing a respectivefunction graph and/or a subgraph of the respective function graph. Thus,each function graph can be implemented as a single process or multipleprocesses. For instance, the messages communicated between nodes of asub-graph dedicated to motion planning for an autonomous vehicle canhelp identify a basis path for the vehicle given the area/environment inwhich the vehicle is operating, motion constraints, costs, vehicletrajectories, etc.

In some implementations, one or more of the plurality of processes220A-N can include containerized services (application containers,etc.). For instance, each process 220A-N can be implemented as acontainer (e.g., docker containers, etc.). For example, the plurality ofprocesses 220A-N can include one or more containerized processesabstracted away from an operating system 250 associated with eachrespective device 205A. As an example, the containerized processes canbe run in docker containers, such that each process is run andauthorized in isolation. For example, each respective container caninclude one or more designated computing resources (e.g., processingpower, memory locations, etc.) devoted to processes configured to runwithin the respective container. Moreover, in some implementations, eachcontainer can include an isolated runtime configuration (e.g., softwaremodel, etc.). In this manner, each container can independently runprocesses within a container specific runtime environment.

The plurality of devices 205A-N, sensors 280, processes 220A-N, etc. ofthe computing system 200 (e.g., the plurality of processes of thevehicle computing system 110, a plurality of processes of the one ormore remote devices, etc.) can be communicatively connected over one ormore wireless and/or wired networks 120. For instance, the plurality ofdevices 205A-N (and/or processes 220A-N of device 205A) can communicateover one or more communication channels. Each device and/or process canexchange messages over the one or more communicative channels using amessage interchange format (e.g., JSON, IDL, etc.). By way of example, arespective process can utilize one or more communication protocols(e.g., HTTP, REST, gRPC, etc.) to provide and/or receive messages fromone or more respective device processes (e.g., other processes runningon the same device) and/or remote processes (e.g., processes running onone or more other devices of the computing system). In this manner,devices can be configured to communicate messages between one or moredevices, services, and/or other processes to carry out one or moretasks. The messages, for example, can include function output dataassociated with a respective function node (e.g., 235).

FIG. 3A depicts a block diagram 300 of an example motion planning systemaccording to example embodiments of the present disclosure. The vehiclecomputing system (e.g., vehicle computing system 110 in FIG. 1 ) of theautonomous vehicle can generate trajectories for the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) using a multi-step process. Insome examples, some steps of the process can be performed out-of-cycle(e.g., not part of the real-time path generation cycle) 302 and somesteps of the process are performed during the real-time path generationcycle.

The out-of-cycle planning system 302 can include a lane geometrygenerator 304 be configured to generate lane geometry for a plurality ofpotential lanes including, but not limited to lane boundaries for one ormore lanes, determine a nominal path or centerline for each lane, and/ordetermine any other relevant factors for a particular area. In someexamples, generating lane geometry may be accomplished or assisted by ageometry planner. For example, the lane geometer generator can determinethe location of a nominal path through an area (e.g., following thecenterline of a target lane) without specific knowledge of any transientobstacles that currently block the path.

In addition to a lane geometry generator 304, an obstacle identificationsystem 306 can, as another out of cycle step, generate a list of staticobjects in the relevant geographic area, including, but not limited to,buildings, signs, mailboxes, other semi-permanent fixtures, etc. Thelane geometry (including one or more nominal paths) and the list ofobstacles generated by the out-of-cycle planning system 302 can beaccessed by the vehicle computing system (e.g., vehicle computing system110 in FIG. 1 ) for use by the trajectory generation system 310 whileperforming in-cycle path planning.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can employ an in-cycle planning system 330 to generate specifictrajectories based on the data produced by the out of cycle planningsystem 302. The in-cycle panning system 330 can include a trajectorygeneration system 310. The trajectory generation system 310 can includea basis path generator 312, a lateral offset generator 314, a spatialpath generator 316, a speed profile generator 318, a trajectorygenerator 320, and a costing system 322.

The basis path generator 312 can generate one or more paths from thecurrent position of the autonomous vehicle (e.g., autonomous vehicle 105in FIG. 1 ) to a point on a target nominal path. Once the one or morebasis paths are generated, they can be transmitted to a spatial pathgenerator 316. The spatial path generator 316 can access a lateraloffset generator 314 to generate a plurality of offset profiles. Eachoffset profile can be generated to include a plurality of offset values.An offset value can represent the distance and direction that therespective trajectory differs from the initial travel path at one ormore times from the basis path. For example, a particular offset valuemay indicate that at a time 3 seconds into the basis path, therespective candidate trajectory places the autonomous vehicle 0.7 metersleft of the basis path. In some implementations, the offset profile canbe represented as a line on a graph wherein one axis on the graphrepresents the degree and direction of lateral variation from theinitial travel path and the other axis represents time. Thus, each basispath can have a plurality of associated candidate trajectories that varylaterally from the original basis path based on the values in thelateral offset profile.

In addition, a speed profile generator 318 can generate a plurality ofspeed profiles (which describe target speeds for the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) at each point along a basispath). In some examples, a speed profile can be generated to includedata indicating one or more acceleration values and, for eachacceleration value, a time at which that acceleration value will beimplemented. For instance, a speed profile can include a representationof a planned acceleration at one or more points in time. Based on thisacceleration, a current velocity can be determined at any point in theacceleration. Additionally, or alternatively, the speed profile caninclude one or more velocities and a time at which the autonomousvehicle (e.g., autonomous vehicle 105 in FIG. 1 ) will reach thosevelocities. The speed profile can also include a vehicle jerk and/or anodometer position.

Additionally, or alternatively, the different types of speed profilescan be used and/or generated based on the specific characteristics of agiven basis path. For example, a first type of speed profile can beassociated with a situation in which emergency braking is necessary. Thespeed profiles of the first type of speed profile can be constructedusing piece-wise constant jerk segments (e.g., the speed profiles cancomprise a sequence of cubic polynomials).

A second type of speed profile can be associated with a situation inwhich a specific speed is a target (e.g., the autonomous vehicle isintending to achieve a particular speed and then coast at that speed).Speed profiles of the second type can be generated to use piece-wiseconstant snap calculations (e.g., the speed profiles can comprise asequence of quartic polynomial functions).

A third type of speed profile can be associated with a situation inwhich the autonomous vehicle is targeting a speed for a particulardistance (e.g., stop signs, traffic lights, gridlock, or the predictedmovement of other actors within the environment). Speed profiles of thethird type can be generated to use piece-wise constant cracklecalculations (e.g., the speed profiles can comprise a sequence ofquintic polynomial functions).

In some examples, the speed profiles can be generated based, at least inpart, on map data including stopping locations such as stop signs,traffic lights, and/or traffic gridlock. The speed profiles can also begenerated based on speed targets associated with a legal speed limit ora velocity target associated with one or more other factors (e.g.,measured average traffic velocity for a particular area). In addition,the speed profiles can be generated based, at least in part, on theposition and speed of actors in the location associated with theautonomous vehicles. In some examples, the vehicle computing system canpredict the future movement of one or more actors for use during thegeneration of speed profiles. In this way, the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ) can adaptively adjust itsmotion/behavior so that it can travel behind or in front of anotheraction (e.g., with a safe buffer distance).

A trajectory generator 320 can generate a plurality of candidatetrajectories based on different combinations of a basis path, an offsetprofile, and/or a speed profile. To generate a trajectory, an offsetprofile can be mapped onto a basis path and matched with a particularspeed profile. Thus, each trajectory follows the general path of thebasis path with one or more lateral adjustments and with the velocityand/or acceleration values designated by the speed profile. The vehiclecomputing system can generate a large number of candidate trajectoriesfor the autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ).This allows many additional alternatives to quickly and efficiently beconsidered, while still maintaining a high degree of safety for theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ). Forexample, if the basis path can be represented as a path through anenvironment, the offset profile for a particular trajectory can berepresented as a path that follows the general route of the basis pathbut is offset laterally along the basis path as a function of distance.The degree to which the particular trajectory is laterally offset fromthe basis path can be represented as a function of time. Similarly, thespeed profile can represent the expected velocity of the autonomousvehicle (e.g., autonomous vehicle 105 in FIG. 1 ) at each point in timewhen following the basis path. The trajectory generator 320 can generatea new trajectory by accessing a basis path, selecting an offset profile,and a speed profile. This information can be combined to result in atrajectory.

Once a plurality of candidate trajectories have been generated, eachtrajectory can be assigned a cost based on a plurality of costdetermination functions by a costing system 322. The vehicle computingsystem (e.g., vehicle computing system 110 in FIG. 1 ) can select acandidate trajectory with the lowest total cost 324 and implement it asvehicle control commands to control the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ).

FIG. 3B depicts a block diagram of an example basis path generationsystem 312 according to example embodiments of the present disclosure.The basis path can be generated by a basis path generation system 312.The basis path generation system 312 can include a state analysis system332, a merge point selection system 334, a geometry modification system336, and a candidate analysis system 338.

The state analysis system 332 can determine the current state of theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ). Forexample, the state analysis system 332 can determine the currentposition (e.g., using an x, y coordinate, polar coordinates within acertain space), speed, heading, acceleration, turning radius, and/orother operating parameters of the autonomous vehicle (e.g., autonomousvehicle 105 in FIG. 1 ).

Based at least in part on the state of the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ), the merge point selection system 334can generate a plurality of candidate merge points at which theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) can join(or rejoin) the target nominal path. In some examples, the merge pointselection system 334 can determine a lane change region associated withjoining the target nominal path (e.g., in situations in which theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) is changinglanes). In some examples, lane change regions are predetermined featuresof the lane geometry that represent an area in which lane changes arepossible. In other examples, a lane change region can be determineddynamically based on the position and speed of the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) as well as the geometry of thelanes. Thus, if the velocity of the autonomous vehicle (e.g., autonomousvehicle 105 in FIG. 1 ) is higher, the merge point selection system 334can select a larger lane change region to give additional flexibility tothe autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ).

In some examples, the merge points can be existing features of the lanegeometry (e.g., coordinates that make up the nominal path). In thiscase, the merge point selection system 334 can identify all merge pointsthat are within a selected lane change region (or proximate thereto).Additionally, or alternatively, the merge points can be generated by themerge point selection system 334 by identifying an initial point alongthe nominal path that is within the lane change region, and thenidentifying a plurality of candidate merge points by incrementallyadding an interval distance along the nominal path until the end of thelane change region has been reached or a certain number of merge pointshave been generated.

The merge point selection system 334 can filter the plurality ofcandidate merge points to remove any that are unsuitable immediately. Todo so, the merge point selection system 334 can order/prioritize thecandidate merge points based on longitudinal distance along the nominalpath. The merge point selection system 334 can use a classifier toimmediately eliminate some merge points. The classifier can take, asinput, the speed (v) of the autonomous vehicle (e.g., autonomous vehicle105 in FIG. 1 ), the curvature (c) of the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ), the lateral distance to the targetnominal lath (d), and/or the heading distance between the autonomousvehicle's current heading and the target heading at the candidate mergepoint (dth). The merge point selection system 334 can fit a functionregressor (F) such that s=F(d, v, c, dth). If the candidate mergepoint's longitudinal distance along the nominal path is greater than s,the merge point can be retained. If not, the merge point selectionsystem 334 can eliminate the merge point from consideration as being toocurvy (e.g., unlikely to result in a drivable basis path).

Once the plurality of candidate merge points has been filtered, themerge point selection system 334 can generate a fit polynomial for apath to each remaining candidate merge point. Generating fit polynomialsis relatively cheap in a computational sense and as such, the cost indoing so can be relatively small. A fit polynomial can be a polynomialthat has been generated to intersect with a given set of points. Thus,if a path between a current position of an autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ) is represented by a number of points(e.g., coordinates that the autonomous vehicle (e.g., autonomous vehicle105 in FIG. 1 ) travels between to follow the path), a fit polynomialcan be generated such that follows that planned path and intersects eachpoint in the path. Techniques for generating fit polynomials are wellknown to those in the art. The merge point selection system 334 can usea generated fit polynomial to determine whether the associated pathbetween the autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 )and a given candidate merge point intersects with a lane boundary (e.g.,identified in map data, sensor data) between the current lane and thetarget lane instead of passing through the determined lane changeregion. If the path does not pass through the determined lane changeregion, the merge point can be eliminated from consideration.

In some examples, each candidate merge point that intersects a laneboundary within a determined lane change region can be selected for usein generating a basis path. In this way, the basis path generationsystem 312 can generate a plurality of potential basis paths. In otherexamples, the merge point selection system 334 can identify one or asmall fixed number of candidate merge points as being the most likelycandidates. Note that if the basis path generation 312 does not includea lane change (e.g., the basis path corrects the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) back to the nominal path itwas already following) then no merge points are generated. Instead, themerge point selection system 334 can select a point along the nominalpath (s) where s=s0+round-up(F(d, v, c, dth), 1.0) wherein S0 is a pointalong the current nominal path where the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ) is projected to be.

Once one or more merge points have been selected, the geometrymodification system 336 can determine whether the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) will be changing lanes. Insome examples, the basis path generation system 312 has been instructedexplicitly to change lanes by another component of the vehicle computingsystem (e.g., vehicle computing system 110 in FIG. 1 ) or a remoteservice system (e.g. to prepare for a turn or to avoid an obstacle). Inother examples, the basis path generation system 312 can determine thata lane change is necessary based on an analysis of the current positionof the autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) andthe location of the target nominal path.

In the case where the autonomous vehicle (e.g., autonomous vehicle 105in FIG. 1 ) is not changing lanes, the geometry modification system 336can alter stored lane boundary data (e.g., lane boundary offsets) tofollow the new path back to the nominal path (e.g., the centerline ofthe lane). The geometry modification system 336 can determine a seriesof points along the proposed basis path from the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) to a point along the nominalpath. For each point, the geometry modification system 336 can calculatenew lane boundary offset value by extending a ray out perpendicularlyfrom the point on the new path until it intersects an existing laneboundary. This distance can be set as the new lane boundary offset.

In the case in which the autonomous vehicle (e.g., autonomous vehicle105 in FIG. 1 ) is changing lanes, the geometry modification system 336can alter stored information about lane boundaries to remove the laneboundaries within the lane change region. New lane offsets can bedetermined along the one or more basis paths by inserting new laneoffset values with a fixed distance (e.g., 2.5 meters) that follow alongeach generated basis path.

Once one or more basis paths have been generated by the basis pathgeneration system 312, a candidate analysis system 338 can evaluate eachcandidate basis path to determine whether the candidate basis path meetsone or more drivability criteria. Drivability criteria can includelimits on speed (e.g., 40 m/s), acceleration (e.g., 1.4 m/s²), jerk(e.g., 0.9 m/s³), and so on.

For example, a first basis path can be generated such that the mergepoint with the target nominal path occurs within 5 meters along thetarget nominal path from of the current position of the autonomousvehicle (e.g., autonomous vehicle 105 in FIG. 1 ), requiring theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) to turnsharply to follow the first basis path. The estimated acceleration totravel the first basis path can be calculated to be 2 m/s², whichexceeds the acceleration limit value. As a result, the first basis pathcan be excluded for failing to meet at least one drivability criterion.In another example, a second basis path is generated such that the mergepoint with the target nominal path is 20 meters along the second basispath from the position of the autonomous vehicle (e.g., autonomousvehicle 105 in FIG. 1 ). The estimated speed, acceleration, and jerk canbe calculated to fall within the predetermined limits. Thus, the secondbasis path can be determined to meet the one or more drivabilitycriteria. The candidate analysis system 338 can select one or more basispaths that meet the drivability criteria.

FIG. 4 depicts an example diagram illustrating an autonomous vehiclemerging with a target path according to example embodiments of thepresent disclosure. In this example, an autonomous vehicle 402 canreturn to a centerline (e.g., a nominal path) of a lane 404 in which theautonomous vehicle 402 is already located. The autonomous vehicle 402can identify a merge point 406 along the target nominal path 408, usingthe techniques described herein.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can determine the current location and pose of the autonomousvehicle 402. The vehicle computing system (e.g., vehicle computingsystem 110 in FIG. 1 ) can generate one or more basis paths 410 from thecurrent position of the autonomous vehicle (e.g., autonomous vehicle 105in FIG. 1 ) and the merge point 406.

FIG. 5 depicts an example diagram illustrating the generation of a basispath for changing lanes according to example embodiments of the presentdisclosure. In this example, the autonomous vehicle 502 starts outsidethe target lane 504. The target lane can be defined by two laneboundaries (e.g., 506-1 and 506-2) and have a nominal path 508 (e.g., apath that follows the centerline of the target lane 504).

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can identify a lane change region 510 that identifies a portion of alane boundary (in this case lane boundary 506-1) through which theautonomous vehicle 502 can pass to change into the target lane 504(e.g., to be located within the target lane 504). In some examples, thelane change region 510 can be selected based on the velocity andposition of the autonomous vehicle 502 (e.g., such that the lane changeregion 510 allows enough space and time for the autonomous vehicle 502to safely change lanes). Additionally, or alternatively, the lane changeregion 510 can be selected based on one or more legal lane designations(e.g., legal authority can designate some sections of a roadway asdisallowing particular lane changes and some sections of a roadway asallowing particular lane changes. a section of a roadway as anon-passing zone).

Based on a determined lane change region 510, the vehicle computingsystem (e.g., vehicle computing system 110 in FIG. 1 ) can identify oneor more merge points (e.g., 512-1, 512-2, 512-3, and 512-4). Note thatthe merge points do not need to be within the area of the laneassociated with the lane change region 510. Merge points can beidentified that are outside the lane change region 510 as long as theautonomous vehicle 502 will pass through the lane change region 510 whencrossing the associated lane boundary 506-1.

One (or more) of the merge points (512-1 to 512-4) can be selected and abasis path 514 can be generated from the current location of theautonomous vehicle 502 to the selected merge point (M3 512-3) in thisexample. In some examples, the vehicle computing system (e.g., vehiclecomputing system 110 in FIG. 1 ) can generate potential basis paths formultiple merge points (e.g., 512-1 to 512-4) and evaluated fordrivability. One or more of the potential basis paths can be selectedand passed to the spatial path generator (e.g., spatial path generator316 in FIG. 3A).

FIG. 6 depicts an example diagram illustrating the generation of mergepoints within a lane change region (608 and 618) according to exampleembodiments of the present disclosure. In this example, a firstpotential basis path 606 and a second potential basis path 616 can beevaluated based on their associated drivability. In this case, theautonomous vehicle 602 has an initial position and heading such that thefirst potential basis path 606 to a merge point 604 can be too curvy tomeet one or more drivability criteria (e.g., too frequent changes indirection and/or an acceleration value that exceeds a predeterminedlimit).

For the second potential basis path 616, the autonomous vehicle 610 isin a similar position but has a different initial heading and thussecond potential basis path 616 to the merge point 614 is significantlysmoother than the first potential basis path 606 for autonomous vehicle602. Thus, the initial position and heading of the autonomous vehicle602 and 610 can have a significant result on which merge points can beultimately selected.

Because the first potential basis path does not meet one or moredrivability requirements, its associated merge point can be rejected.The second potential basis path does meet the one or more drivabilityrequirements as thus its associated merge point can be accepted.

FIG. 7 depicts an example diagram illustrating the alteration of laneboundaries according to example embodiments of the present disclosure.In this example, the autonomous vehicle 702 can select a particularmerge point 704 and generate a basis path 706 to that merge point 704.The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can generate updated representations of lane boundaries along thepath to the nominal path 712.

For example, the vehicle computing system (e.g., vehicle computingsystem 110 in FIG. 1 ) can determine the basis path 706 that theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) isfollowing. The vehicle computing system (e.g., vehicle computing system110 in FIG. 1 ) can determine an offset distance (e.g., 2 meters) andestablish the updated representations of lane boundaries (708 and 710)such that they follow the basis path 706 and are offset by the offsetdistance both to the left 708 and the right 710 of the basis path 706.

In this way, the trajectories that are generated do not receive a costpenalty based on the old lane boundary positions and do receive a costpenalty when crossing over the new lane boundary positions.

FIG. 8 depicts a flow chart diagram of an example method according toexample embodiments of the present disclosure. One or more portions ofmethod 800 can be implemented by one or more computing devices such as,for example, a computing device of an autonomous vehicle (e.g.,autonomous vehicle 105) and/or a computing system offboard/remote froman autonomous vehicle (e.g., as depicted in FIG. 1 ). One or moreportions of the method 700 described herein can be implemented as analgorithm on the hardware components of the devices described herein(e.g., as in FIGS. 1, 3A, 3B, 9, 10 ) to, for example, generate basispaths for an autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1). Although FIG. 8 depicts steps performed in a particular order forpurposes of illustration and discussion, method 800 of FIG. 8 is notlimited to the particularly illustrated order or arrangement. Thevarious steps of the methods disclosed herein can be omitted,rearranged, combined, and/or adapted in various ways without deviatingfrom the scope of the present disclosure. The various steps aredescribed, for example, as being performed by a computing system onboardan autonomous vehicle for example purposes. One or more portions couldalso, or alternatively, be performed by a system offboard/remote fromthe autonomous vehicle.

An autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) caninclude a vehicle computing system (e.g., vehicle computing system 110in FIG. 1 ). The vehicle computing system (e.g., vehicle computingsystem 110 in FIG. 1 ) can, at 802, obtain a target nominal path. Insome examples, the target nominal path can be received from a remoteserver system associated with the autonomous vehicle (e.g., autonomousvehicle 105 in FIG. 1 ).

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can, at 804, determine a current pose for the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ). The current pose for anautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) can includea current location and a current heading. The current location of theautonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) can beassociated with a first lane and the target nominal path can beassociated with a second lane. For example, if the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) is changing lanes to make aturn, the current lane and the target lane can be two different lanes.In some examples, a lane boundary separates the first lane and thesecond lane.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can, at 806, determine, based on the current pose of the autonomousvehicle and the target nominal path, a lane change region. In someexamples, the vehicle computing system (e.g., vehicle computing system110 in FIG. 1 ) can determine the lane change region by generating speeddata associated with the autonomous vehicle (e.g., autonomous vehicle105 in FIG. 1 ) and the target nominal path. The vehicle computingsystem (e.g., vehicle computing system 110 in FIG. 1 ) can determine alongitudinal plan based on the speed data. In some examples, the lanechange region can be determined based at least in part on thelongitudinal plan.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can, at 808 determine one or more merge points on the target nominalpath. The vehicle computing system (e.g., vehicle computing system 110in FIG. 1 ) can identify an initial point along the target nominal pathwithin the lane change region. The vehicle computing system (e.g.,vehicle computing system 110 in FIG. 1 ) can identify a first mergepoint at a predetermined distance along the target nominal path from theinitial point.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can identify additional merge points by starting at the first mergepoint and identifying additional merge points along the target nominalpath. In some examples, the distance interval between the one or moremerge points remains constant. The vehicle computing system (e.g.,vehicle computing system 110 in FIG. 1 ) can filter the one or moremerge points to remove any merge points that fall outside apredetermined threshold distance from the lane change region. Thepredetermined threshold distance can be a fixed distance such as 10meters. Additionally, or alternatively, the predetermined thresholddistance can be based on the current velocity of the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ). Thus, for example, thepredetermine threshold distance can be set at ten times the currentvelocity of the autonomous vehicle (e.g., autonomous vehicle 105 in FIG.1 ) in m/s. So if an autonomous vehicle (e.g., autonomous vehicle 105 inFIG. 1 ) has a velocity of 1 m/s, the predetermined threshold distancecan be 10 meters. If the current velocity is 5 m/s, the predeterminedthreshold distance can be 50 meters.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can, at 810, for each respective merge point in the one or moremerge points, generate a candidate basis path from the current pose ofthe autonomous vehicle (e.g., autonomous vehicle 105 in FIG. 1 ) to therespective merge point. The vehicle computing system (e.g., vehiclecomputing system 110 in FIG. 1 ) can, at 812, generate a suitabilityclassification for each candidate basis path.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can, for each candidate basis path, determine whether anacceleration rate associated with the candidate basis path exceeds apredetermined acceleration threshold. The suitability classification isbased, at least in part on whether the acceleration rate exceeds apredetermined acceleration threshold. For each candidate basis path, thevehicle computing system (e.g., vehicle computing system 110 in FIG. 1 )can determine whether a curvature associated with the candidate basispath exceeds a predetermined curvature threshold. The suitabilityclassification can be based, at least in part on whether the maximumcurvature exceeds a predetermined curvature threshold.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can select, at 814, one or more candidate basis paths based at leastin part on the suitability classification for each respective candidatebasis path in the one or more candidate basis paths. The vehiclecomputing system (e.g., vehicle computing system 110 in FIG. 1 ) cangenerate a plurality of candidate trajectories for the autonomousvehicle (e.g., autonomous vehicle 105 in FIG. 1 ) based on the selectedcandidate basis paths.

The vehicle computing system (e.g., vehicle computing system 110 in FIG.1 ) can determine a cost associated with each candidate trajectory inthe plurality of candidate trajectories for the autonomous vehicle. Thevehicle computing system (e.g., vehicle computing system 110 in FIG. 1 )can select a candidate trajectory based on the costs associated with theplurality of candidate trajectories for the autonomous vehicle (e.g.,autonomous vehicle 105 in FIG. 1 ). The vehicle computing system (e.g.,vehicle computing system 110 in FIG. 1 ) can convert the selectedcandidate trajectory into one or more vehicle controls forimplementation by the autonomous vehicle (e.g., autonomous vehicle 105in FIG. 1 ).

FIG. 9 depicts an example system 900 with units for performingoperations and functions according to example aspects of the presentdisclosure. Various means can be configured to perform the methods andprocesses described herein. For example, a computing system can includepath obtaining units(s), pose determination units(s), regionidentification units(s), merge point determination units(s), pathgeneration units(s), classification units(s), selection units(s), and/orother means for performing the operations and functions describedherein. In some implementations, one or more of the units may beimplemented separately. In some implementations, one or more units maybe a part of or included in one or more other units. These means caninclude processor(s), microprocessor(s), graphics processing unit(s),logic circuit(s), dedicated circuit(s), application-specific integratedcircuit(s), programmable array logic, field-programmable gate array(s),controller(s), microcontroller(s), and/or other suitable hardware. Themeans can also, or alternately, include software control meansimplemented with a processor or logic circuitry for example. The meanscan include or otherwise be able to access memory such as, for example,one or more non-transitory computer-readable storage media, such asrandom-access memory, read-only memory, electrically erasableprogrammable read-only memory, erasable programmable read-only memory,flash/other memory device(s), data registrar(s), database(s), and/orother suitable hardware.

The means can be programmed to perform one or more algorithm(s) forcarrying out the operations and functions described herein. Forinstance, the means can be configured to obtain a target nominal path.For example, a vehicle computing system (e.g., vehicle computing system110 in FIG. 1 ) can access target nominal path data from a map databasestored in an accessible computing system. A path obtaining unit 902 isone example of a means for obtaining a target nominal path.

The means can be configured to determine a current pose for theautonomous vehicle. For example, the vehicle computing system (e.g.,vehicle computing system 110 in FIG. 1 ) can determine the location,speed, and heading of the autonomous vehicle (e.g., autonomous vehicle105 in FIG. 1 ). A pose determination unit 904 is one example of a meansfor determining a current pose for the autonomous vehicle.

The means can be configured to determine, based on the current pose ofthe autonomous vehicle and the target nominal path, a lane changeregion. For example, the vehicle computing system (e.g., vehiclecomputing system 110 in FIG. 1 ) can determine a specific distance alonga lane at which a lane change region begins and ends based on thecharacteristics of the lane and the speed and pose of the autonomousvehicle (e.g., autonomous vehicle 105 in FIG. 1 ). A regionidentification unit 906 is one example of a means for determining, basedon the current pose of the autonomous vehicle and the target nominalpath, a lane change region.

The means can be configured to determine one or more merge points on thetarget nominal path. For example, the vehicle computing system (e.g.,vehicle computing system 110 in FIG. 1 ) can identify a series ofcoordinates that make up the nominal path. The vehicle computing system(e.g., vehicle computing system 110 in FIG. 1 ) can identify eachcoordinate from the nominal path that falls within the lane changeregion as potential merge points. The potential merge points can befiltered to remove any unsuitable merge points. A merge pointdetermination unit 908 is one example of a means for determining one ormore merge points on the target nominal path.

The means can be configured to, for each respective merge point in theone or more merge points, generate a candidate basis path from thecurrent pose of the autonomous vehicle to the respective merge point.For example, the vehicle computing system (e.g., vehicle computingsystem 110 in FIG. 1 ) can plan a path from the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) to each candidate merge point.A path generation unit 910 is one example of a means for, for eachrespective merge point in the one or more merge points, generating acandidate basis path from the current pose of the autonomous vehicle(e.g., autonomous vehicle 105 in FIG. 1 ) to the respective merge point.

The means can be configured to generate a suitability classification foreach candidate basis path. For example, the vehicle computing system(e.g., vehicle computing system 110 in FIG. 1 ) can evaluate a maximumacceleration rate, speed, and/or turning rate for the candidate basispath. A classification unit 912 is one example of a means for generatinga suitability classification for each candidate basis path.

The means can be configured to select a candidate basis path based onthe suitability classification for each respective candidate basis pathin the one or more candidate basis paths. For example, the vehiclecomputing system (e.g., vehicle computing system 110 in FIG. 1 ) canchoose the basis path that is the most suitable for reaching a point onthe target nominal path. A selection unit 914 is one example of a meansfor selecting a candidate basis path based on the suitabilityclassification for each respective candidate basis path in the one ormore candidate basis paths.

FIG. 10 depicts example system components according to example aspectsof the present disclosure. The example system 1000 illustrated in FIG.10 is provided as an example only. The components, systems, connections,and/or other aspects illustrated in FIG. 10 are optional and areprovided as examples of what is possible, but not required, to implementthe present disclosure. The computing system 1000 can be and/or includethe vehicle computing system 110 of FIG. 1 . The computing system 1000can be associated with an operations system and/or an entity associatedwith the vehicle 105 such as, for example, a vehicle owner, vehiclemanager, fleet operator, service provider, etc.

The computing device(s) 1005 of the computing system 1000 can includeprocessor(s) 1015 and at least one memory 1020. The one or moreprocessors 1015 can be any suitable processing device (e.g., a processorcore, a microprocessor, an ASIC, an FPGA, a controller, amicrocontroller, etc.) and can be one processor or a plurality ofprocessors that are operatively connected. The memory 1020 can includeone or more non-transitory computer-readable storage media, such as RAM,ROM, EEPROM, EPROM, one or more memory devices, flash memory devices,magnetic disks, data registers, etc., and combinations thereof.

The memory 1020 can store information that can be accessed by the one ormore processors 1015. For instance, the memory 1020 (e.g., one or morenon-transitory computer-readable storage mediums, memory devices) caninclude computer-readable instructions 1025 that can be executed by theone or more processors 1015. The instructions 1025 can be softwarewritten in any suitable programming language or can be implemented inhardware. Additionally, or alternatively, the instructions 1025 can beexecuted in logically and/or virtually separate threads on processor(s)1015

For example, the memory 1020 on-board the vehicle 105 can storeinstructions 1025 that when executed by the one or more processors 1015cause the one or more processors 1015 (e.g., in the vehicle computingsystem 110) to perform operations such as any of the operations andfunctions of the computing device(s) 1005 and/or vehicle computingsystem 110 (and its sub-systems (e.g., the motion planner system 170C,etc.)), any of the operations and functions for which the vehiclecomputing system 110 (and/or its subsystems) are configured, anyportions of the methods described herein, and/or any other operationsand functions described herein. Memory for a system offboard a vehiclecan store instructions to perform any operations and functions of theoffboard systems described herein and/or the operations and functions ofthe autonomous vehicle (its computing system), methods, and/or any otheroperations and functions described herein.

The memory 1020 can store data 1030 that can be obtained (e.g.,received, accessed, written, manipulated, created, generated, etc.)and/or stored. The data 1030 can include, for instance, services data(e.g., trip data, route data, user data, etc.), sensor data, map data,perception data, prediction data, motion planning data, merge pointdata, acceleration data, threshold drivability data, basis path data,nominal path data, speed profile data, offset profile data, drivabilitycriteria data, and/or other data/information as described herein. Insome implementations, the computing device(s) 1005 can obtain data fromone or more memories that are remote from the autonomous vehicle 105.

The computing device(s) 1005 can also include a communication interface1040 used to communicate with one or more other system(s) (e.g., theremote computing system). The communication interface 1040 can includeany circuits, components, software, etc. for communicating via one ormore networks (e.g., network(s)). In some implementations, thecommunication interface 1040 can include, for example, one or more of: acommunications controller, a receiver, a transceiver, a transmitter, aport, conductors, software, and/or hardware for communicating data.

Computing tasks discussed herein as being performed at computingdevice(s) remote from the autonomous vehicle can instead be performed atthe autonomous vehicle (e.g., via the vehicle computing system), or viceversa. Such configurations can be implemented without deviating from thescope of the present disclosure. The use of computer-based systemsallows for a great variety of possible configurations, combinations, anddivisions of tasks and functionality between and among components.Computer-implemented operations can be performed on a single componentor across multiple components. Computer-implements tasks and/oroperations can be performed sequentially or in parallel. Data andinstructions can be stored in a single memory device or across multiplememory devices.

Aspects of the disclosure have been described in terms of illustrativeembodiments thereof. Numerous other embodiments, modifications, and/orvariations within the scope and spirit of the appended claims can occurto persons of ordinary skill in the art from a review of thisdisclosure. Any and all features in the following claims can be combinedand/or rearranged in any way possible.

While the present subject matter has been described in detail withrespect to various specific example embodiments thereof, each example isprovided by way of explanation, not limitation of the disclosure. Thoseskilled in the art, upon attaining an understanding of the foregoing,can readily produce alterations to, variations of, and/or equivalents tosuch embodiments. Accordingly, the subject disclosure does not precludeinclusion of such modifications, variations, and/or additions to thepresent subject matter as would be readily apparent to one of ordinaryskill in the art. For instance, features illustrated and/or described aspart of one embodiment can be used with another embodiment to yield astill further embodiment. Thus, it is intended that the presentdisclosure cover such alterations, variations, and/or equivalents.

What is claimed is:
 1. A computer-implemented method for generating oneor more basis paths for an autonomous vehicle, the method comprising:obtaining a target nominal path; determining a current pose for theautonomous vehicle; determining a plurality of merge points on thetarget nominal path; determining, based on the current pose of theautonomous vehicle and the target nominal path, a lane change region;for each respective merge point in the plurality of merge points,generating a candidate basis path from the autonomous vehicle to therespective merge point, such that a plurality of candidate basis pathsare generated, the plurality of candidate basis paths being respectiveto a one or more merge points; generating a suitability classificationfor each of the plurality of candidate basis paths; selecting a selectedbasis path from the plurality of candidate basis paths based on thesuitability classification for each respective candidate basis path inthe plurality of candidate basis paths; altering an internally-storedrepresentation of lane boundaries to remove the lane boundaries withinthe lane change region; and controlling the autonomous vehicle tonavigate in accordance with a trajectory based on the selected basispath.
 2. The computer-implemented method of claim 1, wherein the currentpose for the autonomous vehicle includes a current location and acurrent heading.
 3. The computer-implemented method of claim 2, whereinthe current location of the autonomous vehicle is associated with afirst lane.
 4. The computer-implemented method of claim 3, wherein thetarget nominal path is associated with a second lane.
 5. Thecomputer-implemented method of claim 4, wherein a lane boundaryseparates the first lane and the second lane.
 6. Thecomputer-implemented method of claim 5, further comprising: determining,based at least in part on the current pose of the autonomous vehicle andthe target nominal path, a lane change region along the lane boundary.7. The computer-implemented method of claim 6, wherein determining,based at least in part on the current pose of the autonomous vehicle andthe target nominal path, a lane change region along the lane boundaryfurther comprises: generating speed data associated with the autonomousvehicle and the target nominal path; and determining a longitudinal planbased on the speed data.
 8. The computer-implemented method of claim 7,wherein the lane change region is determined based at least in part onthe longitudinal plan.
 9. The computer-implemented method of claim 1,wherein generating a suitability classification for each candidate basispath further comprises: for each candidate basis path, determiningwhether an acceleration rate associated with the candidate basis pathexceeds a predetermined acceleration threshold, wherein the suitabilityclassification is based, at least in part on whether the accelerationrate exceeds the predetermined acceleration threshold.
 10. Thecomputer-implemented method of claim 1, wherein generating a suitabilityclassification for each candidate basis path further comprises: for eachcandidate basis path, determining whether a maximum curvature associatedwith the candidate basis path exceeds a predetermined turning threshold,wherein the suitability classification is based, at least in part onwhether the maximum curvature associated with the candidate basis pathexceeds the predetermined turning threshold.
 11. Thecomputer-implemented method of claim 1, further comprising: generating aplurality of candidate trajectories for the autonomous vehicle based onthe selected candidate basis path.
 12. The computer-implemented methodof claim 11, further comprising: determining a cost associated with eachcandidate trajectory in the plurality of candidate trajectories for theautonomous vehicle; and selecting a candidate trajectory based on thecosts associated with the plurality of candidate trajectories for theautonomous vehicle.
 13. The computer-implemented method of claim 12,further comprising: converting the selected candidate trajectory intoone or more vehicle controls for implementation by the autonomousvehicle.
 14. A computing system for generating one or more basis pathsfor an autonomous vehicle, the computing system comprising: one or moreprocessors and one or more non-transitory computer-readable memories;wherein the one or more non-transitory computer-readable memories storeinstructions that are executable by the one or more processors to causethe computing system to perform operations, the operations comprising:obtaining a target nominal path; determining a current pose for theautonomous vehicle; determining, based on the current pose of theautonomous vehicle and the target nominal path, a lane change region;determining a plurality of merge points on the target nominal path basedat least in part on the lane change region; for each respective mergepoint in the plurality of merge points, generating a candidate basispath from the autonomous vehicle to the respective merge point, suchthat a plurality of candidate basis paths are generated, the pluralityof candidate basis paths being respective to the plurality of mergepoints; generating a suitability classification for each of theplurality of candidate basis paths; selecting a selected basis path fromthe plurality of candidate basis paths based on the suitabilityclassification for each respective candidate basis path in the pluralityof candidate basis paths; altering an internally-stored representationof lane boundaries to remove the lane boundaries within the lane changeregion; and controlling the autonomous vehicle to navigate in accordancewith a trajectory based on the selected basis path.
 15. The computingsystem of claim 14, wherein determining the plurality of merge points onthe target nominal path further comprises: identifying an initial pointalong the target nominal path within the lane change region; andidentifying a first merge point at a predetermined distance along thetarget nominal path from the initial point.
 16. The computing system ofclaim 15, wherein determining the plurality of merge points on thetarget nominal path further comprises: identifying additional mergepoints by starting at the first merge point and identifying additionalmerge points along the target nominal path.
 17. The computing system ofclaim 16, wherein a distance interval between the the plurality of mergepoints remains constant.
 18. The computing system of claim 16, whereindetermining the plurality of merge points on the target nominal pathfurther comprises: filtering the the plurality of merge points to removeany merge points that fall outside a predetermined threshold distancefrom the lane change region.
 19. An autonomous vehicle, comprising: oneor more processors; and one or more non-transitory computer-readablemedia that store instructions that are executable by the one or moreprocessors to cause the one or more processors to perform operations,the operations comprising: obtaining a target nominal path; determininga current pose for the autonomous vehicle; determining, based on thecurrent pose of the autonomous vehicle and the target nominal path, alane change region; determining one or more merge points on the targetnominal path based at least in part on the lane change region; for eachrespective merge point in the plurality of merge points, generating acandidate basis path from the autonomous vehicle to the respective mergepoint, such that a plurality of candidate basis paths are generated, theplurality of candidate basis paths being respective to the one or moremerge points; generating a suitability classification for each of theplurality of candidate basis paths; selecting a selected basis path fromthe plurality of candidate basis paths based on the suitabilityclassification for each respective candidate basis path in the pluralityof candidate basis paths; altering an internally-stored representationof lane boundaries to remove the lane boundaries within the lane changeregion; and controlling the autonomous vehicle to navigate in accordancewith a trajectory based on the selected basis path.
 20. The autonomousvehicle of claim 19, wherein the current pose for the autonomous vehicleincludes a current location and a current heading.